A Global Dual Error Bound and Its Application to the Analysis of Linearly Constrained Nonconvex Optimization
From MaRDI portal
Publication:5869816
DOI10.1137/20M135474XzbMath1501.90079arXiv2006.16440OpenAlexW4295950862MaRDI QIDQ5869816
Publication date: 29 September 2022
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.16440
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the linear convergence of the alternating direction method of multipliers
- Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs
- On a global error bound for a class of monotone affine variational inequality problems
- Error bounds and convergence analysis of feasible descent methods: A general approach
- On the convergence of the coordinate descent method for convex differentiable minimization
- Error bounds for analytic systems and their applications
- Error bounds in mathematical programming
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
- Global convergence of ADMM in nonconvex nonsmooth optimization
- A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property
- Lower bounds for finding stationary points I
- Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
- Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- Error bounds for support vector machines with application to the identification of active constraints
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization
- Optimal Linear Precoding Strategies for Wideband Non-Cooperative Systems Based on Game Theory—Part II: Algorithms
- On Nonconvex Decentralized Gradient Descent
- A Proximal Alternating Direction Method of Multiplier for Linearly Constrained Nonconvex Minimization
- Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs
