A superlinearly convergent hybrid algorithm for solving nonlinear programming

DOI10.3934/JIMO.2016059MaRDI QIDQ2628199zbMATH OpenOpenAlexFDO

Authors Chuanhao Guo, Erfang Shan, Wenli Yan

Publication date 12 June 2017

Published in Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/jimo.2016059

zbMATH Keywords

global and locally one-step superlinear convergencenonlinear programmingsequential quadratic programmingsystem of linear equationsworking set

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)

Recommendations

• A superlinearly convergent numerical algorithm for nonlinear programming
• A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization
• A superlinearly convergent hybrid algorithm for systems of nonlinear equations
• An improved sequential quadratic programming algorithm for solving general nonlinear programming problems
• A successive quadratic programming algorithm with global and superlinear convergence properties

Cites work

• A matrix-free trust-region SQP method for equality constrained optimization
• A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization
• A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization
• A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization
• A new technique for inconsistent QP problems in the SQP method
• A second derivative SQP method: local convergence and practical issues
• A sequential quadratic programming algorithm with an additional equality constrained phase
• A strongly convergent method of quasi-strongly sub-feasible directions for constrained optimization
• A surperlinearly convergent algorithm for constrained optimization problems
• Adaptive SQP method for shape optimization
• An improved sequential quadratic programming algorithm for solving general nonlinear programming problems
• Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
• Benchmarking optimization software with performance profiles.
• Exact penalty function algorithm with simple updating of the penalty parameter
• GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
• Infeasibility Detection and SQP Methods for Nonlinear Optimization
• More test examples for nonlinear programming codes
• On combining feasibility, descent and superlinear convergence in inequality constrained optimization
• On the Accurate Identification of Active Constraints
• Sequential systems of linear equations method for general constrained optimization without strict complementarity
• Test example for nonlinear programming codes

Cited in

(3)

• A mixed superlinearly convergent algorithm with nonmonotone search for constrained optimizations
• A superlinearly convergent hybrid algorithm for systems of nonlinear equations
• A Mixed and Superlinearly Convergent Algorithm for Constrained Optimization

This page was built for publication: A superlinearly convergent hybrid algorithm for solving nonlinear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2628199)