A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
Automatic repair of convex optimization problems
Given an infeasible, unbounded, or pathological convex optimization problem, a natural question to ask is: what is the smallest change we can make to the problem’s parameters such that the problem becomes solvable? In this paper, we address this question by posing it as an optimization problem involving the minimization of a convex regularization function of the parameters, subject to the constraint that the parameters result in a solvable problem. We propose a heuristic for approximately solving this problem that is based on the penalty method and leverages recently developed methods that can efficiently evaluate the derivative of the solution of a convex cone program with respect to its parameters. We illustrate our method by applying it to examples in optimal control and economics.
Automatic repair of convex optimization problems
Given an infeasible, unbounded, or pathological convex optimization problem, a natural question to ask is: what is the smallest change we can make to the problem’s parameters such that the problem becomes solvable? In this paper, we address this question by posing it as an optimization problem involving the minimization of a convex regularization function of the parameters, subject to the constraint that the parameters result in a solvable problem. We propose a heuristic for approximately solving this problem that is based on the penalty method and leverages recently developed methods that can efficiently evaluate the derivative of the solution of a convex cone program with respect to its parameters. We illustrate our method by applying it to examples in optimal control and economics.
Automatic repair of convex optimization problems
Optim Eng
Barratt, Shane (author) / Angeris, Guillermo (author) / Boyd, Stephen (author)
Optimization and Engineering ; 22 ; 247-259
2021-03-01
13 pages
Article (Journal)
Electronic Resource
English
Sequential Convex Programming for Structural Optimization Problems
| Springer Verlag | 1993
Convex optimization for inequality constrained adjustment problems
| UB Braunschweig | 2015
On solution sets for convex optimization problems
| British Library Online Contents | 2018
Stochastic subgradient method for quasi-convex optimization problems
| British Library Online Contents | 2016