Path-following proximal approach for solving ill-posed convex semi-infinite programming problems

DOI10.1007/BF02192249zbMath0866.90129OpenAlexW2031038080MaRDI QIDQ2565003

Alexander Kaplan, Rainer Tichatschke

Publication date: 7 January 1997

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02192249

zbMATH Keywords

penalty methodsadaptive discretizationprox-regularizationill-posed, convex semi-infinite programmingregularized path-following

Mathematics Subject Classification ID

Semi-infinite programming (90C34)

Related Items (1)

Linear semi-infinite programming theory: an updated survey

Cites Work

• Well-posed optimization problems
• Modern homotopy methods in optimization
• Semi-Infinite Programming: Theory, Methods, and Applications
• On imbedding and parametric optimization—A concept of a globally convergent algorithm for nonlinear optimization problems
• A globally convergent algorithm with adaptively refined discretization for semi-infinite optimization problems arising in engineering design
• Critical sets in parametric optimization
• Rate-Preserving Discretization Strategies for Semi-Infinite Programming and Optimal Control
• Monotone Operators and the Proximal Point Algorithm
• A regularized penalty method for solving convex semi-infinite programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Path-following proximal approach for solving ill-posed convex semi-infinite programming problems