Automatic repair of convex optimization problems
From MaRDI portal
Publication:2245690
Abstract: 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.
Recommendations
- On the choice of parameters in the residual method for the optimal correction of improper problems of convex optimization
- scientific article; zbMATH DE number 3847229
- On the construction of regularizing algorithms for the correction of improper convex programming problems
- On the application of the residual method for the correction of inconsistent problems of convex programming
- On the application of the regularization method for the correction of improper problems of convex programming
Cites work
- scientific article; zbMATH DE number 2186837 (Why is no real title available?)
- scientific article; zbMATH DE number 1342119 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- A note on resolving infeasibility in linear programs by constraint relaxation
- A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints
- An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem
- Analyzing mathematical programs using MProbe
- Approaches to Diagnosing Infeasible Linear Programs
- Branch-and-Cut for the Maximum Feasible Subsystem Problem
- CVXPY: a Python-embedded modeling language for convex optimization
- Computer-assisted analysis for diagnosing infeasible or unbounded linear programs
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Detecting IIS in infeasible linear programmes using techniques from goal programming
- Feasibility and infeasibility in optimization. Algorithms and computational methods.
- Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program
- Gradient methods for minimizing composite functions
- Infeasibility analysis for systems of quadratic convex inequalities
- Irreducible infeasible subsystems of semidefinite systems
- Irreducibly inconsistent systems of linear inequalities
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- On infeasibility of systems of convex analytic inequalities
- PERUSE: An Interactive System for Mathematical Programs
- Reducibility among combinatorial problems
This page was built for publication: Automatic repair of convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2245690)
