An algorithm of successive minimization in convex programming

DOI10.1051/M2AN/1978120403771zbMATH Open0402.90075OpenAlexW2398195345MaRDI QIDQ4187591FDOQ4187591

Authors: Pierre-Jean Laurent, C. 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)

Cites Work

• Convex Analysis
• Newton's method for convex programming and Tschebyscheff approximation
• Title not available (Why is that?)
• Note on Jordan elimination, linear programming and Tchebyscheff approximation
• Title not available (Why is that?)
• Über diskrete und lineare Tschebyscheff-Approximationen
• Title not available (Why is that?)
• Un Algorithme de Minimisation en Chaine en Optimisation Convexe
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

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

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)