Interior point and outer approximation methods for conic optimization
Any convex optimization problem may be represented as a conic problem that minimizes a linear function over the intersection of an affine subspace with a convex cone. An advantage of representing convex problems in conic form is that, under certain regularity conditions, a conic problem has a simple...
Main Author: | Coey, Christopher Daniel Lang |
---|---|
Other Authors: | Vielma Centeno, Juan Pablo |
Format: | Thesis |
Published: |
Massachusetts Institute of Technology
2022
|
Online Access: | https://hdl.handle.net/1721.1/144941 https://orcid.org/0000-0002-1305-0141 |
Similar Items
-
Outer approximation with conic certificates for mixed-integer convex problems
by: Coey, Chris, et al.
Published: (2021) -
Performance enhancements for a generic conic interior point algorithm
by: Coey, Chris, et al.
Published: (2022) -
Sum of squares generalizations for conic sets
by: Kapelevich, Lea, et al.
Published: (2022) -
An interior−point stochastic approximation method and an L1−regularized delta rule
by: Carbonetto, P, et al.
Published: (2008) -
Quantum Interior Point Methods for Semidefinite Optimization
by: Brandon Augustino, et al.
Published: (2023-09-01)