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 16 items.
- A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence (Q848564) (← links)
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions (Q1044081) (← links)
- A new SQP method of feasible directions for nonlinear programming. (Q1415268) (← links)
- A sequential quadratic programming method for constrained multi-objective optimization problems (Q2053082) (← links)
- Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems (Q2250067) (← links)
- New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate (Q2370024) (← 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)
- Some composite-step constrained optimization methods interpreted via the perturbed sequential quadratic programming framework (Q2943830) (← links)
- (Q3731381) (← links)
- Separable Quadratic Programming via a Primal-Dual Interior Point Method and its Use in a Sequential Procedure (Q4202585) (← links)
- (Q4371065) (← links)
- (Q4665673) (← links)
- A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization (Q5085233) (← links)
- On the Sequential Quadratically Constrained Quadratic Programming Methods (Q5704159) (← links)
