Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
From MaRDI portal
Publication:1044081
DOI10.1016/j.ejor.2009.01.052zbMath1177.90307OpenAlexW2109910358MaRDI QIDQ1044081
Hai-Yan Zheng, Chun-Ming Tang, Jin-Bao Jian
Publication date: 10 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.01.052
optimizationquadratically constrained quadratic programmingsuperlinear convergenceSQCQPnorm-relaxed algorithm
Related Items
A SSLE-Type Algorithm of Quasi-Strongly Sub-Feasible Directions for Inequality Constrained Minimax Problems ⋮ A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem ⋮ 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 ⋮ A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization ⋮ Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions ⋮ A working set SQCQP algorithm with simple nonmonotone penalty parameters ⋮ A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application ⋮ A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function ⋮ A Globally Convergent SQCQP Method for Multiobjective Optimization Problems ⋮ A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization ⋮ A quadratically approximate framework for constrained optimization, global and local convergence ⋮ A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization ⋮ Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems ⋮ A global QP-free algorithm for mathematical programs with complementarity constraints ⋮ A sequential quadratically constrained quadratic programming method for unconstrained minimax problems ⋮ A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
- More test examples for nonlinear programming codes
- Applications of second-order cone programming
- Test examples for nonlinear programming codes
- A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
- Norm-relaxed method of feasible directions for solving nonlinear programming problems
- Second-order cone programming
- An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
- Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization
- New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate
- On local convergence of sequential quadratically-constrained quadratic-programming type methods, with an extension to variational problems
- A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
- Computing a Trust Region Step
- A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- A Second-order method for the discrete min-max problem
- Some methods of solving convex programming problems
- Combined phase I—phase II methods of feasible directions
- ADMIT-1
- A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization
- A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming
- On the Sequential Quadratically Constrained Quadratic Programming Methods
