Pages that link to "Item:Q2480785"
From MaRDI portal
The following pages link to A sequential quadratically constrained quadratic programming method of feasible directions (Q2480785):
Displaying 6 items.
- A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence (Q848564) (← links)
- Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems (Q2250067) (← links)
- Quadratically constraint quadratical algorithm model for nonlinear minimax problems (Q2378762) (← links)
- A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems (Q2435607) (← links)
- A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization (Q2841139) (← links)
- A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization (Q5085233) (← links)
