An algorithm of successive minimization in convex programming
From MaRDI portal
Publication:4187591
Cites work
- scientific article; zbMATH DE number 3136964 (Why is no real title available?)
- scientific article; zbMATH DE number 3511873 (Why is no real title available?)
- scientific article; zbMATH DE number 3542175 (Why is no real title available?)
- scientific article; zbMATH DE number 3548314 (Why is no real title available?)
- scientific article; zbMATH DE number 3238760 (Why is no real title available?)
- scientific article; zbMATH DE number 3250175 (Why is no real title available?)
- scientific article; zbMATH DE number 3302906 (Why is no real title available?)
- scientific article; zbMATH DE number 3378720 (Why is no real title available?)
- Convex Analysis
- Newton's method for convex programming and Tschebyscheff approximation
- Note on Jordan elimination, linear programming and Tchebyscheff approximation
- Un Algorithme de Minimisation en Chaine en Optimisation Convexe
- Über diskrete und lineare Tschebyscheff-Approximationen
Cited in
(7)- Near-optimal solutions of convex semi-infinite programs via targeted sampling
- Approximation in normed linear spaces
- A Fast Algorithm for Linear Complex Chebyshev Approximations
- Convergent Algorithms for a Class of Convex Semi-infinite Programs
- A cutting plane method for solving minimax problems in the complex plane
- A modified exchange algorithm for distributional robust optimization and applications in risk management
- Constrained minimax approximation and optimal preconditioners for Toeplitz matrices
This page was built for publication: An algorithm of successive minimization in convex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4187591)
