Automatic repair of convex optimization problems
From MaRDI portal
Publication:2245690
DOI10.1007/s11081-020-09508-9zbMath1473.90112arXiv2001.11010OpenAlexW3027962898MaRDI QIDQ2245690
Publication date: 15 November 2021
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.11010
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Gradient methods for minimizing composite functions
- Irreducibly inconsistent systems of linear inequalities
- On infeasibility of systems of convex analytic inequalities
- Infeasibility analysis for systems of quadratic convex inequalities
- An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem
- A note on resolving infeasibility in linear programs by constraint relaxation
- Irreducible infeasible subsystems of semidefinite systems
- A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints
- Feasibility and infeasibility in optimization. Algorithms and computational methods.
- Detecting IIS in infeasible linear programmes using techniques from goal programming
- Lectures on Modern Convex Optimization
- CVXPY: A Python-Embedded Modeling Language for Convex Optimization
- Branch-and-Cut for the Maximum Feasible Subsystem Problem
- Computer-assisted analysis for diagnosing infeasible or unbounded linear programs
- PERUSE: An Interactive System for Mathematical Programs
- Approaches to Diagnosing Infeasible Linear Programs
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program
- Reducibility among Combinatorial Problems
- Analyzing mathematical programs using MProbe
This page was built for publication: Automatic repair of convex optimization problems
