A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
From MaRDI portal
Publication:858741
DOI10.1016/j.amc.2006.04.050zbMath1108.65064OpenAlexW2011305981MaRDI QIDQ858741
Qing-Jie Hu, Hai-Yan Zheng, Jin-Bao Jian, Chun-Ming Tang
Publication date: 11 January 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.04.050
algorithmglobal convergencenumerical resultsnonlinear programmingsuperlinear convergencemethod of feasible directions
Related Items (20)
A SSLE-Type Algorithm of Quasi-Strongly Sub-Feasible Directions for Inequality Constrained Minimax Problems ⋮ A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity ⋮ A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization ⋮ Quadratically constraint quadratical algorithm model for nonlinear minimax problems ⋮ Primal-dual interior point QP-free algorithm for nonlinear constrained optimization ⋮ A symmetric splitting sequential quadratic optimization algorithm for two-block nonlinearly constrained nonconvex optimization ⋮ A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization ⋮ A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization ⋮ A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application ⋮ Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems ⋮ A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization ⋮ A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems ⋮ A new superlinearly convergent SQP algorithm for nonlinear minimax problems ⋮ A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences ⋮ A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization ⋮ A new feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization ⋮ A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization ⋮ A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization ⋮ A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization ⋮ An ADMM-based SQP method for separably smooth nonconvex optimization
Cites Work
- More test examples for nonlinear programming codes
- Test examples for nonlinear programming codes
- Global convergence analysis of algorithms for finding feasible points in norm-relaxed MFD
- A generalization of the norm-relaxed method of feasible directions
- Norm-relaxed method of feasible directions for solving nonlinear programming problems
- A new SQP method of feasible directions for nonlinear programming.
- A mixed superlinearly convergent algorithm with nonmonotone search for constrained optimizations
- A superlinearly and quadratically convergent SQP type feasible method for constrained optimization
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization
- A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- Combined phase I—phase II methods of feasible directions
- Rate of Convergence of a Class of Methods of Feasible Directions
- On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
- A superlinearly convergent method of feasible directions.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
