Conic optimization via operator splitting and homogeneous self-dual embedding

DOI10.1007/s10957-016-0892-3zbMath1342.90136arXiv1312.3039OpenAlexW2288174618MaRDI QIDQ301735

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

zbMATH Keywords

optimization operator splitting cone programming first-order methods

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Numerical methods involving duality (49M29) Numerical methods based on necessary conditions (49M05)

Related Items

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