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.050zbMATH Open1108.65064OpenAlexW2011305981MaRDI QIDQ858741FDOQ858741
Qingjie Hu, Jinbao Jian, Chun-Ming Tang, Haiyan Zheng
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
Recommendations
- A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- Publication:4487995
- A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity
- A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints
- A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems
nonlinear programmingnumerical resultsalgorithmglobal convergencesuperlinear convergencemethod of feasible directions
Cites Work
- More test examples for nonlinear programming codes
- Test examples for nonlinear programming codes
- A new SQP method of feasible directions for nonlinear programming.
- A computationally efficient feasible sequential quadratic programming algorithm
- Title not available (Why is that?)
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- Title not available (Why is that?)
- A superlinearly convergent method of feasible directions.
- Combined phase I—phase II methods of feasible directions
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization
- On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
- 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 norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- Rate of Convergence of a Class of Methods of Feasible Directions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A superlinearly and quadratically convergent SQP type feasible method for constrained optimization
- Title not available (Why is that?)
- A mixed superlinearly convergent algorithm with nonmonotone search for constrained optimizations
Cited In (26)
- A symmetric splitting sequential quadratic optimization algorithm for two-block nonlinearly constrained nonconvex optimization
- Quadratically constraint quadratical algorithm model for nonlinear minimax problems
- A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity
- A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization
- An ADMM-based SQP method for separably smooth nonconvex optimization
- A new superlinearly convergent SQP algorithm for nonlinear minimax problems
- A superlinearly convergent method of feasible directions.
- A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization
- A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints
- A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization
- A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization
- Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems
- A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization
- A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences
- A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization
- Primal-dual interior point QP-free algorithm for nonlinear constrained optimization
- A partially feasible Jacobi-type distributed SQO method for two-block general linearly constrained smooth optimization
- A SSLE-Type Algorithm of Quasi-Strongly Sub-Feasible Directions for Inequality Constrained Minimax Problems
- A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems
- A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization
- A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization
- A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application
- Title not available (Why is that?)
- 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
This page was built for publication: A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858741)
