Pages that link to "Item:Q1044081"
From MaRDI portal
The following pages link to Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions (Q1044081):
Displayed 17 items.
- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization (Q393748) (← links)
- Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions (Q439450) (← links)
- A working set SQCQP algorithm with simple nonmonotone penalty parameters (Q654747) (← links)
- A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization (Q669396) (← links)
- A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function (Q939555) (← links)
- A quadratically approximate framework for constrained optimization, global and local convergence (Q943517) (← links)
- A sequential quadratically constrained quadratic programming method for unconstrained minimax problems (Q1039448) (← links)
- A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization (Q1740436) (← links)
- A global QP-free algorithm for mathematical programs with complementarity constraints (Q2069554) (← links)
- A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application (Q2226311) (← links)
- Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems (Q2250067) (← links)
- A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization (Q2841139) (← links)
- A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem (Q5058916) (← links)
- A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization (Q5085233) (← links)
- A sequential quadratic programming algorithm without a penalty function, a filter or a constraint qualification for inequality constrained optimization (Q5085236) (← links)
- A Globally Convergent SQCQP Method for Multiobjective Optimization Problems (Q5148405) (← links)
- A SSLE-Type Algorithm of Quasi-Strongly Sub-Feasible Directions for Inequality Constrained Minimax Problems (Q5881251) (← links)