210 results on '"Jian, Jin Bao"'
Search Results
2. Monotone Splitting SQP Algorithms for Two-block Nonconvex Optimization Problems with General Linear Constraints and Applications
3. Convergence of Bregman Peaceman–Rachford Splitting Method for Nonconvex Nonseparable Optimization
4. A Bregman-style Partially Symmetric Alternating Direction Method of Multipliers for Nonconvex Multi-block Optimization
5. Two efficient nonlinear conjugate gradient methods with restart procedures and their applications in image restoration
6. A generalized hybrid CGPM-based algorithm for solving large-scale convex constrained equations with applications to image restoration
7. A New Superlinearly Convergent Algorithm of Combining QP Subproblem with System of Linear Equations for Nonlinear Optimization
8. An Improved Sequential Quadratic Programming Algorithm for Solving General Nonlinear Programming Problems
9. A Feasible Point Method with Bundle Modification for Nonsmooth Convex Constrained Optimization
10. A globally convergent QP-free algorithm for nonlinear semidefinite programming
11. Two efficient nonlinear conjugate gradient methods with restart procedures and their applications in image restoration
12. A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization
13. A regularized alternating direction method of multipliers for a class of nonconvex problems
14. New active set identification for general constrained optimization and minimax problems
15. A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization
16. A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences
17. Tighter relaxation method for unit commitment based on second-order cone programming and valid inequalities
18. An improved sequential quadratic programming algorithm for solving general nonlinear programming problems
19. A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems
20. Convergence of Bregman Peaceman–Rachford Splitting Method for Nonconvex Nonseparable Optimization
21. An improved infeasible SSLE method for constrained optimization without strict complementarity
22. Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions
23. Superlinearly Convergent Norm-Relaxed SQP Method Based on Active Set Identification and New Line Search for Constrained Minimax Problems
24. A working set SQCQP algorithm with simple nonmonotone penalty parameters
25. On the accurate identification of active set for constrained minimax problems
26. An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments
27. A model-hybrid approach for unconstrained optimization problems
28. Two modified nonlinear conjugate gradient methods with disturbance factors for unconstrained optimization
29. An ε-generalized gradient projection method for nonlinear minimax problems
30. Simple Sequential Quadratically Constrained Quadratic Programming Feasible Algorithm with Active Identification Sets for Constrained Minimax Problems
31. A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
32. Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
33. A sequential quadratically constrained quadratic programming method for unconstrained minimax problems
34. A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization
35. A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization
36. A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization
37. A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity
38. A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization.
39. A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems
40. A sufficient descent Dai–Yuan type nonlinear conjugate gradient method for unconstrained optimization problems
41. An improved feasible QP-free algorithm for inequality constrained optimization
42. Inverse problems and solution methods for a class of nonlinear complementarity problems
43. Two new predictor-corrector algorithms for second-order cone programming
44. A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming
45. A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function
46. A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization
47. An SQP algorithm for mathematical programs with nonlinear complementarity constraints
48. A quadratically approximate framework for constrained optimization, global and local convergence
49. A Sequential Quadratically Constrained Quadratic Programming Method of Feasible Directions
50. A New Superlinearly Convergent SQP Algorithm for Nonlinear Minimax Problems
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.