A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization
DOI10.1016/J.NONRWA.2011.03.017zbMATH Open1223.49034OpenAlexW2086926527MaRDI QIDQ635233FDOQ635233
Publication date: 19 August 2011
Published in: Nonlinear Analysis. Real World Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.nonrwa.2011.03.017
Recommendations
- A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization
- A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity
- A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization
- A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
constrained optimizationactive set identificationglobal and superlinear convergencemethod of quasi-strongly sub-feasible directionsnorm-relaxed SQP method
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Linear-quadratic optimal control problems (49N10)
Cites Work
- CUTEr and SifDec
- On the Accurate Identification of Active Constraints
- A new SQP method of feasible directions for nonlinear programming.
- A computationally efficient feasible sequential quadratic programming algorithm
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- Title not available (Why is that?)
- A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
- A superlinearly convergent method of feasible directions.
- Title not available (Why is that?)
- On the accurate identification of active set for constrained minimax problems
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization
- 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
- A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization
- An efficient feasible SQP algorithm for inequality constrained optimization
- Title not available (Why is that?)
Cited In (12)
- Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems
- A dwindling filter algorithm with a modified subproblem for nonlinear inequality constrained optimization
- A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization
- A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization
- A sequential quadratic programming algorithm without a penalty function, a filter or a constraint qualification for inequality constrained optimization
- New active set identification for general constrained optimization and minimax problems
- Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems
- A global QP-free algorithm for mathematical programs with complementarity constraints
- A SSLE-Type Algorithm of Quasi-Strongly Sub-Feasible Directions for Inequality Constrained Minimax Problems
- A hybrid genetic algorithm-based parameter identification method for nonlinear hysteretic system with experimental verification
- A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization
- Convergence of a Three-Dimensional Dwindling Filter Algorithm Without Feasibility Restoration Phase
Uses Software
This page was built for publication: A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q635233)
