Pages that link to "Item:Q3004977"
From MaRDI portal
The following pages link to Minimizing the Condition Number of a Gram Matrix (Q3004977):
Displayed 9 items.
- A recurrent neural network for solving a class of generalized convex optimization problems (Q459437) (← links)
- Solving semi-infinite programs by smoothing projected gradient method (Q480937) (← links)
- Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems (Q496609) (← links)
- Smoothing methods for nonsmooth, nonconvex minimization (Q715249) (← links)
- A smoothing augmented Lagrangian method for solving simple bilevel programs (Q742311) (← links)
- On solving simple bilevel programs with a nonconvex lower level program (Q2452381) (← links)
- <i>K</i>-Optimal Design via Semidefinite Programming and Entropy Optimization (Q5252232) (← links)
- On Exact<i>K</i>-optimal Designs Minimizing the Condition Number (Q5419353) (← links)
- Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs (Q5501232) (← links)