A sequential quadratically constrained quadratic programming method of feasible directions

DOI10.1007/S00245-007-9010-0MaRDI QIDQ2480785zbMATH OpenOpenAlexFDO

Authors Jinbao Jian, Qingjie Hu, Chun-Ming Tang, Haiyan Zheng

Publication date 3 April 2008

Published in Applied Mathematics and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00245-007-9010-0

zbMATH Keywords

Convergence rateGlobal convergenceInequality constrained optimizationMethod of feasible directionsQuadratic constraints quadratic programming

Mathematics Subject Classification ID

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

Recommendations

• New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate
• A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization
• A variant of feasible descent SQP method for inequality constrained optimization
• A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence
• A new SQP method of feasible directions for nonlinear programming.

Cites work

• A computationally efficient feasible sequential quadratic programming algorithm
• A generalization of the norm-relaxed method of feasible directions
• A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
• A globally and superlinearly convergent SQP algorithm for nonlinear constrained optimization.
• A globally convergent method for nonlinear programming
• A new technique for inconsistent QP problems in the SQP method
• A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
• A Second-order method for the discrete min-max problem
• A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization
• A superlinearly and quadratically convergent SQP type feasible method for constrained optimization
• A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
• A superlinearly convergent method of feasible directions.
• A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming
• Exact penalty function algorithm with simple updating of the penalty parameter
• scientific article; zbMATH DE number 3159112 (Why is no real title available?)
• scientific article; zbMATH DE number 1186894 (Why is no real title available?)
• scientific article; zbMATH DE number 780774 (Why is no real title available?)
• scientific article; zbMATH DE number 883157 (Why is no real title available?)
• Norm-relaxed method of feasible directions for solving nonlinear programming problems
• On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
• On the Local and Superlinear Convergence of Quasi-Newton Methods
• On the rate of convergence of certain methods of centers
• Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
• Rate of Convergence of a Class of Methods of Feasible Directions
• Robust recursive quadratic programming algorithm model with global and superlinear convergence properties
• Some methods of solving convex programming problems
• Superlinear convergence of a stabilized SQP method to a degenerate solution
• Test examples for nonlinear programming codes
• Two extension models of SQP and SSLE algorithms for optimizaiton and their superlinear and quadratic convergence

Cited in

(17)

• Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
• A new SQP method of feasible directions for nonlinear programming.
• A sequential quadratic programming method for constrained multi-objective optimization problems
• Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems
• New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate
• Quadratically constraint quadratical algorithm model for nonlinear minimax problems
• A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems
• A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization
• Some composite-step constrained optimization methods interpreted via the perturbed sequential quadratic programming framework
• scientific article; zbMATH DE number 3963585 (Why is no real title available?)
• Separable Quadratic Programming via a Primal-Dual Interior Point Method and its Use in a Sequential Procedure
• scientific article; zbMATH DE number 1101644 (Why is no real title available?)
• A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization
• scientific article; zbMATH DE number 2155131 (Why is no real title available?)
• A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization
• On the Sequential Quadratically Constrained Quadratic Programming Methods
• A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence

Describes a project that uses

Uses Software

• SOCP

This page was built for publication: A sequential quadratically constrained quadratic programming method of feasible directions

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