A Unifying Polyhedral Approximation Framework for Convex Optimization
From MaRDI portal
Publication:3004988
DOI10.1137/090772204zbMath1218.90154OpenAlexW2023653074MaRDI QIDQ3004988
Huizhen Yu, Dimitri P. Bertsekas
Publication date: 6 June 2011
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/66974
convex optimizationpolyhedral approximationcutting planesimplicial decompositionmonotropic programming
Numerical mathematical programming methods (65K05) Convex programming (90C25) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (10)
A hybrid LP/NLP paradigm for global optimization relaxations ⋮ Polyhedral approximation of spectrahedral shadows via homogenization ⋮ An oracle-based framework for robust combinatorial optimization ⋮ A polyhedral approximation approach to concave numerical dynamic programming ⋮ Construction of constrained experimental designs on finite spaces for a modified \(\mathrm{E}_k\)-optimality criterion ⋮ Microscopic path structure of optimally aligned random sequences ⋮ Parameter space optimization towards integrated mechatronic design for uncertain systems with generalized feedback constraints ⋮ A representation of generalized convex polyhedra and applications ⋮ A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs ⋮ Sparse Inverse Problems over Measures: Equivalence of the Conditional Gradient and Exchange Methods
Uses Software
This page was built for publication: A Unifying Polyhedral Approximation Framework for Convex Optimization
