On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming
From MaRDI portal
Publication:2136507
DOI10.1007/s40305-021-00344-xzbMath1499.49087OpenAlexW3187813627MaRDI QIDQ2136507
Publication date: 10 May 2022
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-021-00344-x
Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Nonlinear programming (90C30) Decomposition methods (49M27)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- OSQP: An Operator Splitting Solver for Quadratic Programs
- Tikhonov, Ivanov and Morozov regularization for support vector machine learning
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- On the linear convergence of the alternating direction method of multipliers
- A unified primal-dual algorithm framework based on Bregman iteration
- The structured elastic net for quantile regression and support vector classification
- Semi-infinite programming
- Feature selection guided by structural information
- Applications of second-order cone programming
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A proximal-based deomposition method for compositions method for convex minimization problems
- On the application of the auxiliary problem principle
- Second-order cone programming
- DistOpt: A software framework for modeling and evaluating optimization problem solutions in distributed environments
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- First-order algorithms for convex optimization with nonseparable objective and coupled constraints
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Mirror Prox algorithm for multi-term composite minimization and semi-separable problems
- On the global and linear convergence of the generalized alternating direction method of multipliers
- Regularized Jacobi-type ADMM-methods for a class of separable convex optimization problems in Hilbert spaces
- A unified approach for minimizing composite norms
- A survey on the continuous nonlinear resource allocation problem
- An SQP-type algorithm for nonlinear second-order cone programs
- Multiplier and gradient methods
- Robust Convex Optimization
- A Majorized ADMM with Indefinite Proximal Terms for Linearly Constrained Convex Composite Optimization
- The Planning of Guaranteed Targeted Display Advertising
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Partial Error Bound Conditions and the Linear Convergence Rate of the Alternating Direction Method of Multipliers
- Proximity Maps for Convex Sets
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Semi-infinite programming, duality, discretization and optimality conditions†
- A primal–dual interior point method for nonlinear optimization over second-order cones
- Projection on a Cone, Penalty Functionals and Duality Theory for Problems with Inequaltity Constraints in Hilbert Space
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Differentiable Exact Penalty Functions for Nonlinear Second-Order Cone Programs
- A Primal-Dual Algorithm with Line Search for General Convex-Concave Saddle Point Problems
- On the Local Convergence of Semismooth Newton Methods for Linear and Nonlinear Second-Order Cone Programs Without Strict Complementarity
- A Distributed ADMM-like Method for Resource Sharing over Time-Varying Networks
- A Unified Framework for the Scheduling of Guaranteed Targeted Display Advertising Under Reach and Frequency Requirements
- Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
- Learning Theory and Kernel Machines
- On the Global Linear Convergence of the ADMM with MultiBlock Variables
- Some Properties of the Augmented Lagrangian in Cone Constrained Optimization
- Compressed sensing
