A new alternating direction method for linearly constrained nonconvex optimization problems
From MaRDI portal
Publication:496618
DOI10.1007/s10898-015-0268-5zbMath1354.90100MaRDI QIDQ496618
Publication date: 22 September 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-015-0268-5
90C26: Nonconvex programming, global optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An extension of subgradient method for variational inequality problems in Hilbert space
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints
- Modified extragradient method for variational inequalities and verification of solution existence
- An efficient simultaneous method for the constrained multiple-sets split feasibility problem
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Application of the alternating direction method of multipliers to separable convex programming problems
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities
- Asymptotic properties of the Fenchel dual functional and applications to decomposition problems
- On semi- and subanalytic geometry
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- A new inexact alternating directions method for monotone variational inequalities
- A new modified Goldstein-Levitin-Polyak projection method for variational inequality problems
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- An ADM-based splitting method for separable convex programming
- A proximal parallel splitting method for minimizing sum of convex functions with linear constraints
- A nonsmooth Morse--Sard theorem for subanalytic functions
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
- Clarke Subgradients of Stratifiable Functions
- Monotone Operators and the Proximal Point Algorithm
- Convergence of Proximal-Like Algorithms
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Convergence of a block coordinate descent method for nondifferentiable minimization
