Pages that link to "Item:Q4187591"
From MaRDI portal
The following pages link to An algorithm of successive minimization in convex programming (Q4187591):
Displaying 7 items.
- A cutting plane method for solving minimax problems in the complex plane (Q1200545) (← links)
- Constrained minimax approximation and optimal preconditioners for Toeplitz matrices (Q1315215) (← links)
- Approximation in normed linear spaces (Q1587393) (← links)
- Near-optimal solutions of convex semi-infinite programs via targeted sampling (Q2095909) (← links)
- A Fast Algorithm for Linear Complex Chebyshev Approximations (Q3477868) (← links)
- Convergent Algorithms for a Class of Convex Semi-infinite Programs (Q5043283) (← links)
- A modified exchange algorithm for distributional robust optimization and applications in risk management (Q6092503) (← links)