New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate
From MaRDI portal
Publication:2370024
DOI10.1007/s10957-006-9042-7zbMath1139.90033OpenAlexW2146352558MaRDI QIDQ2370024
Publication date: 21 June 2007
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-006-9042-7
Related Items (18)
Quadratically constraint quadratical algorithm model for nonlinear minimax problems ⋮ A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence ⋮ A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization ⋮ A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization ⋮ A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems ⋮ 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 ⋮ Time-delay estimation in state and output equations of nonlinear systems using optimal computational approach ⋮ A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function ⋮ A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization ⋮ 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 hybrid algorithm for nonlinear 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 ⋮ Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
- A generalization of the norm-relaxed method of feasible directions
- Norm-relaxed method of feasible directions for solving nonlinear programming problems
- A new SQP method of feasible directions for nonlinear programming.
- A mixed superlinearly convergent algorithm with nonmonotone search for constrained optimizations
- A superlinearly and quadratically convergent SQP type feasible method for constrained optimization
- A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
- A successive quadratic programming algorithm with global and superlinear convergence properties
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- A surperlinearly convergent algorithm for constrained optimization problems
- A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization
- Rate of Convergence of a Class of Methods of Feasible Directions
- On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
- A superlinearly convergent method of feasible directions.
This page was built for publication: New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate
