On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization
From MaRDI portal
(Redirected from Publication:3544263)
Recommendations
- On free variables in interior point methods
- A regularization interior point method for semidefinite programming with free variables
- On implementing a primal-dual interior-point method for conic quadratic optimization
- Regularization techniques in interior point methods
- Dynamic non-diagonal regularization in interior point methods for linear and convex quadratic programming
Cited in
(11)- A primal-dual regularized interior-point method for convex quadratic programs
- Design and implementation of a modular interior-point solver for linear optimization
- A conversion of an SDP having free variables into the standard form SDP
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
- On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization
- A regularization interior point method for semidefinite programming with free variables
- On free variables in interior point methods
- On the Identification of Zero Variables in an Interior-Point Framework
- A primal-dual regularized interior-point method for semidefinite programming
- On the numerical solution of Lasserre relaxations of unconstrained binary quadratic optimization problem
Describes a project that uses
Uses Software
This page was built for publication: On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3544263)
