An efficient feasible SQP algorithm for inequality constrained optimization

DOI10.1016/J.NONRWA.2008.01.001zbMATH Open1167.90652OpenAlexW2121700601MaRDI QIDQ837710FDOQ837710

Authors: Zhibin Zhu, Jinbao Jian 

Publication date: 20 August 2009

Published in: Nonlinear Analysis. Real World Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.nonrwa.2008.01.001

Recommendations

• A type of efficient feasible SQP algorithms for inequality constrained optimization
• A simple feasible SQP algorithm for inequality constrained optimization
• An improved SQP algorithm for inequality constrained optimization
• A feasible SQP algorithm with superlinear convergence for inequality constrained optimization
• A feasible equality constrained SQP algorithm for nonlinear optimization
• A feasible SQP descent method for inequality constrained optimization problems and its convergence
• A variant of feasible descent SQP method for inequality constrained optimization
• An Inexact SQP Method for Equality Constrained Optimization
• scientific article; zbMATH DE number 5671377
• scientific article; zbMATH DE number 1932419

zbMATH Keywords

global convergencesuperlinear convergencesystem of linear equationsSQP methodinequality constrained optimization

Mathematics Subject Classification ID

Methods of successive quadratic programming type (90C55) Nonlinear programming (90C30)

Cites Work

• Test example for nonlinear programming codes
• An efficient sequential quadratic programming algorithm for nonlinear programming
• Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
• A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
• A Strategy for Global Convergence in a Sequential Quadratic Programming Algorithm
• An improved SQP algorithm for inequality constrained optimization
• A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
• A sequential quadratic programming method for potentially infeasible mathematical programs
• A successive quadratic programming algorithm with global and superlinear convergence properties

Cited In (27)

• Title not available (Why is that?)
• Title not available (Why is that?)
• A type of efficient feasible SQP algorithms for inequality constrained optimization
• A dwindling filter algorithm with a modified subproblem for nonlinear inequality constrained optimization
• A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence
• A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
• An ADMM-based SQP method for separably smooth nonconvex optimization
• A feasible equality constrained SQP algorithm for nonlinear optimization
• A modified strongly sub-feasible SQP algorithm for constrained optimization and numerical experiments
• Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints
• An improved SQP algorithm for inequality constrained optimization
• A feasible SQP algorithm with superlinear convergence for inequality constrained optimization
• A feasible SQP descent method for inequality constrained optimization problems and its convergence
• A variant of feasible descent SQP method for inequality constrained optimization
• An improved feasible QP-free algorithm for inequality constrained optimization
• An improved active set feasible SQP algorithm for the solution of inequality constrained optimization problems
• A feasible trust region SQP method with nonmonotone line search for inequality constrained optimization
• An SQP algorithm with equality constrained subproblems for nonlinear inequality constrained optimization
• A simple feasible SQP algorithm for inequality constrained optimization
• Application of the sequential parametric convex approximation method to the design of robust trusses
• Monotone splitting sequential quadratic optimization algorithm with applications in electric power systems
• A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization
• Convergence of a three-dimensional dwindling filter algorithm without feasibility restoration phase
• Convergence analysis of an ALF-based nonconvex splitting algorithm with SQP structure
• A superlinearly convergent splitting feasible sequential quadratic optimization method for two-block large-scale smooth optimization
• A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application
• Title not available (Why is that?)

This page was built for publication: An efficient feasible SQP algorithm for inequality constrained optimization

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