An algorithm of successive minimization in convex programming

DOI10.1051/m2an/1978120403771zbMath0402.90075OpenAlexW2398195345MaRDI QIDQ4187591

Pierre-Jean Laurent, Claude Carasso

Publication date: 1978

Published in: RAIRO. Analyse numérique (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/193330

zbMATH Keywords

Convex ProgrammingEpfilon-SolutionGeneral Exchange AlgorithmSuccessive Minimization

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items

Convergent Algorithms for a Class of Convex Semi-infinite Programs ⋮ A modified exchange algorithm for distributional robust optimization and applications in risk management ⋮ A cutting plane method for solving minimax problems in the complex plane ⋮ A Fast Algorithm for Linear Complex Chebyshev Approximations ⋮ Approximation in normed linear spaces ⋮ Near-optimal solutions of convex semi-infinite programs via targeted sampling ⋮ Constrained minimax approximation and optimal preconditioners for Toeplitz matrices

Cites Work

• Über diskrete und lineare Tschebyscheff-Approximationen
• Note on Jordan elimination, linear programming and Tchebyscheff approximation
• Newton's method for convex programming and Tschebyscheff approximation
• Un Algorithme de Minimisation en Chaine en Optimisation Convexe
• Convex Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item