Approximate solutions of convex semi-infinite optimization problems in finitely many iterations

05/18/2021
by   Jochen Schmid, et al.
0

We develop two adaptive discretization algorithms for convex semi-infinite optimization, which terminate after finitely many iterations at approximate solutions of arbitrary precision. In particular, they terminate at a feasible point of the considered optimization problem. Compared to the existing finitely feasible algorithms for general semi-infinite optimization problems, our algorithms work with considerably smaller discretizations and are thus computationally favorable. Also, our algorithms terminate at approximate solutions of arbitrary precision, while for general semi-infinite optimization problems the best possible approximate-solution precision can be arbitrarily bad. All occurring finite optimization subproblems in our algorithms have to be solved only approximately, and continuity is the only regularity assumption on our objective and constraint functions. Applications to parametric and non-parametric regression problems under shape constraints are discussed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/21/2021

An Approximation Algorithm for a General Class of Multi-Parametric Optimization Problems

In a widely studied class of multi-parametric optimization problems, the...
research
04/12/2021

Semi-Infinite Linear Regression and Its Applications

Finite linear least squares is one of the core problems of numerical lin...
research
02/02/2023

Provably Robust Semi-Infinite Program Under Collision Constraints via Subdivision

We present a semi-infinite program (SIP) solver for trajectory optimizat...
research
10/24/2014

On the Complexity of Optimization Problems based on Compiled NNF Representations

Optimization is a key task in a number of applications. When the set of ...
research
05/30/2020

Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation

We propose GM-QAOA, a variation of the Quantum Alternating Operator Ansa...
research
07/17/2018

Minimizing convex quadratic with variable precision Krylov methods

Iterative algorithms for the solution of convex quadratic optimization p...
research
10/04/2018

Seamless Parametrization with Arbitrarily Prescribed Cones

Seamless global parametrization of surfaces is a key operation in geomet...

Please sign up or login with your details

Forgot password? Click here to reset