A unifying polyhedral approximation framework for convex optimization
From MaRDI portal
Recommendations
- On the convergence of a class of outer approximation algorithms for convex programs
- Outer approximation by polyhedral convex sets
- Polyhedral approximation in mixed-integer convex optimization
- Integer Programming and Combinatorial Optimization
- Piecewise-Linear Approximation Methods for Nonseparable Convex Optimization
Cited in
(22)- A hybrid LP/NLP paradigm for global optimization relaxations
- An outer approximate subdifferential method for piecewise affine 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
- \(\mathcal{H}\)-polytope decomposition-based algorithm for continuous optimization
- Microscopic path structure of optimally aligned random sequences
- Parameter space optimization towards integrated mechatronic design for uncertain systems with generalized feedback constraints
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs
- A new approximation hierarchy for polynomial conic optimization
- scientific article; zbMATH DE number 5007493 (Why is no real title available?)
- A regularized decomposition method for minimizing a sum of polyhedral functions
- A representation of generalized convex polyhedra and applications
- Sparse inverse problems over measures: equivalence of the conditional gradient and exchange methods
- Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming
- Reliable and Efficient Approximation of Polyconvex Envelopes
- Polyhedral approximation of spectrahedral shadows via homogenization
- From the simplex to the sphere: faster constrained optimization using the Hadamard parametrization
- An oracle-based framework for robust combinatorial optimization
- A majorization-minimization algorithm for optimal sensor location in distributed parameter systems
- Global solution algorithms for DC programming via polyhedral approximations of convex functions
- Decomposition algorithms for computational stochastic mixed-integer programming: a survey
- A parametric approach for solving convex quadratic optimization with indicators over trees
This page was built for publication: A unifying polyhedral approximation framework for convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3004988)
