Path-following proximal approach for solving ill-posed convex semi-infinite programming problems
From MaRDI portal
Publication:2565003
Recommendations
Cites work
- A globally convergent algorithm with adaptively refined discretization for semi-infinite optimization problems arising in engineering design
- A regularized penalty method for solving convex semi-infinite programs
- Critical sets in parametric optimization
- scientific article; zbMATH DE number 3934760 (Why is no real title available?)
- scientific article; zbMATH DE number 3755766 (Why is no real title available?)
- scientific article; zbMATH DE number 17723 (Why is no real title available?)
- scientific article; zbMATH DE number 3504682 (Why is no real title available?)
- scientific article; zbMATH DE number 587626 (Why is no real title available?)
- scientific article; zbMATH DE number 4114406 (Why is no real title available?)
- scientific article; zbMATH DE number 841058 (Why is no real title available?)
- Modern homotopy methods in optimization
- Monotone Operators and the Proximal Point Algorithm
- On imbedding and parametric optimization—A concept of a globally convergent algorithm for nonlinear optimization problems
- Rate-Preserving Discretization Strategies for Semi-Infinite Programming and Optimal Control
- Semi-Infinite Programming: Theory, Methods, and Applications
- Well-posed optimization problems
Cited in
(2)
This page was built for publication: Path-following proximal approach for solving ill-posed convex semi-infinite programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2565003)