Pages that link to "Item:Q3004988"

The following pages link to A Unifying Polyhedral Approximation Framework for Convex Optimization (Q3004988):

Displaying 18 items.

• A hybrid LP/NLP paradigm for global optimization relaxations (Q1621693) (← links)
• A polyhedral approximation approach to concave numerical dynamic programming (Q1994163) (← links)
• Construction of constrained experimental designs on finite spaces for a modified \(\mathrm{E}_k\)-optimality criterion (Q2023572) (← links)
• \(\mathcal{H}\)-polytope decomposition-based algorithm for continuous optimization (Q2127089) (← links)
• Microscopic path structure of optimally aligned random sequences (Q2278651) (← links)
• Parameter space optimization towards integrated mechatronic design for uncertain systems with generalized feedback constraints (Q2280681) (← links)
• A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs (Q2301138) (← links)
• A new approximation hierarchy for polynomial conic optimization (Q2419540) (← links)
• (Q3372231) (← links)
• A regularized decomposition method for minimizing a sum of polyhedral functions (Q3735489) (← links)
• A representation of generalized convex polyhedra and applications (Q5217253) (← links)
• Sparse Inverse Problems over Measures: Equivalence of the Conditional Gradient and Exchange Methods (Q5231667) (← links)
• Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming (Q5233243) (← links)
• Reliable and Efficient Approximation of Polyconvex Envelopes (Q5700273) (← links)
• Polyhedral approximation of spectrahedral shadows via homogenization (Q6150652) (← links)
• From the simplex to the sphere: faster constrained optimization using the Hadamard parametrization (Q6164739) (← links)
• An oracle-based framework for robust combinatorial optimization (Q6183084) (← links)
• A majorization-minimization algorithm for optimal sensor location in distributed parameter systems (Q6619064) (← links)