Conic optimization via operator splitting and homogeneous self-dual embedding
From MaRDI portal
Publication:301735
DOI10.1007/s10957-016-0892-3zbMath1342.90136arXiv1312.3039OpenAlexW2288174618MaRDI QIDQ301735
F. Blanchet-Sadri, M. Dambrine
Publication date: 1 July 2016
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.3039
Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Numerical methods involving duality (49M29) Numerical methods based on necessary conditions (49M05)
Related Items (83)
Stochastic matrix-free equilibration ⋮ Exploiting low-rank structure in semidefinite programming by approximate operator splitting ⋮ Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers ⋮ Scenario-Based Verification of Uncertain MDPs ⋮ Relaxation methods for navigation satellites set optimization ⋮ Coverage Path Planning for 3D Terrain with Constraints on Trajectory Curvature Based on Second-Order Cone Programming ⋮ Frank--Wolfe Methods with an Unbounded Feasible Region and Applications to Structured Learning ⋮ Solving Natural Conic Formulations with Hypatia.jl ⋮ Stochastic block projection algorithms with extrapolation for convex feasibility problems ⋮ Proportional-integral projected gradient method for conic optimization ⋮ Certifying numerical estimates of spectral gaps ⋮ GMRES-Accelerated ADMM for Quadratic Objectives ⋮ Bounds-constrained polynomial approximation using the Bernstein basis ⋮ Alfonso: Matlab Package for Nonsymmetric Conic Optimization ⋮ On property (T) for \(\Aut(F_n)\) and \(\mathrm{SL}_n(\mathbb{Z})\) ⋮ MathOptInterface: A Data Structure for Mathematical Optimization Problems ⋮ Perspective functions: proximal calculus and applications in high-dimensional statistics ⋮ Linear convergence of first order methods for non-strongly convex optimization ⋮ Anderson accelerating the preconditioned modulus approach for linear complementarity problems on second-order cones ⋮ Error bounds, facial residual functions and applications to the exponential cone ⋮ A dynamical neural network approach for solving stochastic two-player zero-sum games ⋮ MG-CNN: a deep CNN to predict saddle points of matrix games ⋮ Observer‐based predictor for a susceptible‐infectious‐recovered model with delays: An optimal‐control case study ⋮ Risk budgeting portfolios from simulations ⋮ CvxPnPL: a unified convex solution to the absolute pose estimation problem from point and line correspondences ⋮ Distance geometry and data science ⋮ Performance enhancements for a generic conic interior point algorithm ⋮ Fixed-order H-infinity controller design for port-Hamiltonian systems ⋮ Optimal rates for estimation of two-dimensional totally positive distributions ⋮ Regional consensus in discrete-time multi-agent systems subject to time-varying delays and saturating actuators ⋮ A dual semismooth Newton based augmented Lagrangian method for large-scale linearly constrained sparse group square-root Lasso problems ⋮ Matrix-Free Convex Optimization Modeling ⋮ New bounds for the empirical robust Kullback-Leibler divergence problem ⋮ Computation of the maximum likelihood estimator in low-rank factor analysis ⋮ Time-Varying Semidefinite Programming: Path Following a Burer–Monteiro Factorization ⋮ Tutorial on Amortized Optimization ⋮ Outer approximation with conic certificates for mixed-integer convex problems ⋮ Multi-task sparse identification for closed-loop systems with general observation sequences ⋮ Faster first-order primal-dual methods for linear programming using restarts and sharpness ⋮ Minimizing oracle-structured composite functions ⋮ Projection onto the exponential cone: a univariate root-finding problem ⋮ Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming ⋮ An Approximation Scheme for Distributionally Robust Nonlinear Optimization ⋮ Estimation of Monge matrices ⋮ Optimal perturbations for nonlinear systems using graph-based optimal transport ⋮ Efficient differentiable quadratic programming layers: an ADMM approach ⋮ Unnamed Item ⋮ Reconstructing manifolds from truncations of spectral triples ⋮ Parameter Selection and Preconditioning for a Graph Form Solver ⋮ Optimal transport over nonlinear systems via infinitesimal generators on graphs ⋮ Globally Convergent Type-I Anderson Acceleration for Nonsmooth Fixed-Point Iterations ⋮ Bounds on mean energy in the Kuramoto–Sivashinsky equation computed using semidefinite programming ⋮ Approximate modularity: Kalton’s constant is not smaller than 3 ⋮ COSMO: a conic operator splitting method for convex conic problems ⋮ Low-Rank Matrix Iteration Using Polynomial-Filtered Subspace Extraction ⋮ Anderson Accelerated Douglas--Rachford Splitting ⋮ FANOK: Knockoffs in Linear Time ⋮ Automatic repair of convex optimization problems ⋮ An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity ⋮ OSQP: An Operator Splitting Solver for Quadratic Programs ⋮ Infeasibility detection in the alternating direction method of multipliers for convex optimization ⋮ A survey on conic relaxations of optimal power flow problem ⋮ Solution refinement at regular points of conic problems ⋮ Tax-aware portfolio construction via convex optimization ⋮ Proximal Distance Algorithms: Theory and Examples ⋮ Chordal decomposition in operator-splitting methods for sparse semidefinite programs ⋮ A distributed algorithm for high-dimension convex quadratically constrained quadratic programs ⋮ Optimal representative sample weighting ⋮ Non-Convex Global Minimization and False Discovery Rate Control for the TREX ⋮ Bounds on heat transfer for Bénard–Marangoni convection at infinite Prandtl number ⋮ Efficient semidefinite programming with approximate ADMM ⋮ Unnamed Item ⋮ Finding unstable periodic orbits: a hybrid approach with polynomial optimization ⋮ On the robustness and scalability of semidefinite relaxation for optimal power flow problems ⋮ A convex optimization approach to radiation treatment planning with dose constraints ⋮ An ADMM-based interior-point method for large-scale linear programming ⋮ Unnamed Item ⋮ \(\Aut(\mathbb{F}_5)\) has property \((T)\) ⋮ Operator Splitting for a Homogeneous Embedding of the Linear Complementarity Problem ⋮ Convergence of Anisotropic Mesh Adaptation via Metric Optimization ⋮ On a primal-dual Newton proximal method for convex quadratic programs ⋮ Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach ⋮ Computing Large Market Equilibria Using Abstractions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Benchmarks for Optimization Software
- Convex.jl
- Matrix-free interior point method
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
- Partial inverse of a monotone operator
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
- Block splitting for distributed optimization
- Optimally scaled matrices
- Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
- A first-order block-decomposition method for solving two-easy-block structured semidefinite programs
- Metric selection in fast dual forward-backward splitting
- Differential properties of Euclidean projection onto power cone
- A primal-dual projection method for solving systems of linear inequalities
- Applications of second-order cone programming
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Parallel alternating direction multiplier decomposition of convex programs
- Dykstra's alternating projection algorithm for two sets
- A multiprojection algorithm using Bregman projections in a product space
- An independent benchmarking of SDP and SOCP solvers
- A simplified homogeneous and self-dual linear programming algorithm and its implementation
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
- Adaptive restart for accelerated gradient schemes
- Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems
- Remarks on optimally scaled matrices
- Condition numbers and equilibration of matrices
- CVXPY: A Python-Embedded Modeling Language for Convex Optimization
- Proximal Splitting Methods in Signal Processing
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- A First-Order Augmented Lagrangian Method for Compressed Sensing
- Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with Halfspaces
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- The Split Bregman Method for L1-Regularized Problems
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- On Pre-Conditioning of Matrices
- Direct Methods for Sparse Linear Systems
- Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit
- Algorithm 849
- Applications of the method of partial inverses to convex programming: Decomposition
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Monotone Operators and the Proximal Point Algorithm
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Iterative oblique projection onto convex sets and the split feasibility problem
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Symmetric Quasidefinite Matrices
- Primal-Dual Decomposition by Operator Splitting and Applications to Image Deblurring
- Self Equivalence of the Alternating Direction Method of Multipliers
- Systems of Structured Monotone Inclusions: Duality, Algorithms, and Applications
- Algorithm 837
- Signal Recovery by Proximal Forward-Backward Splitting
- Convex Analysis
This page was built for publication: Conic optimization via operator splitting and homogeneous self-dual embedding