The following pages link to (Q3840112):
Displaying 9 items.
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← 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)
- Magnetic resonance tissue quantification using optimal bSSFP pulse-sequence design (Q1026924) (← links)
- A sequential quadratically constrained quadratic programming method for unconstrained minimax problems (Q1039448) (← links)
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions (Q1044081) (← links)
- An interior method for nonconvex semidefinite programs (Q1863841) (← links)
- Quadratically constraint quadratical algorithm model for nonlinear minimax problems (Q2378762) (← links)
- A sequential quadratically constrained quadratic programming method of feasible directions (Q2480785) (← links)
