Pages that link to "Item:Q2841139"
From MaRDI portal
The following pages link to A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization (Q2841139):
Displaying 9 items.
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions (Q1044081) (← links)
- A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization (Q1740436) (← links)
- New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate (Q2370024) (← links)
- A sequential quadratically constrained quadratic programming method of feasible directions (Q2480785) (← links)
- Some composite-step constrained optimization methods interpreted via the perturbed sequential quadratic programming framework (Q2943830) (← links)
- (Q3731381) (← links)
- (Q4719027) (← 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)