A new alternating direction method for linearly constrained nonconvex optimization problems
From MaRDI portal
Recommendations
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
- Convergence of ADMM for optimization problems with nonseparable nonconvex objective and linear constraints
- Convergence of generalized alternating direction method of multipliers for nonseparable nonconvex objective with linear constraints
- A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems
- Alternating direction method of multipliers with difference of convex functions
Cites work
- scientific article; zbMATH DE number 3852340 (Why is no real title available?)
- scientific article; zbMATH DE number 1383450 (Why is no real title available?)
- scientific article; zbMATH DE number 1424520 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- scientific article; zbMATH DE number 3371284 (Why is no real title available?)
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A new inexact alternating directions method for monotone variational inequalities
- A new modified Goldstein-Levitin-Polyak projection method for variational inequality problems
- A nonsmooth Morse--Sard theorem for subanalytic functions
- A proximal parallel splitting method for minimizing sum of convex functions with linear constraints
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- Alternating projection based prediction-correction methods for structured variational inequalities
- An ADM-based splitting method for separable convex programming
- An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints
- An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
- An efficient simultaneous method for the constrained multiple-sets split feasibility problem
- An extension of subgradient method for variational inequality problems in Hilbert space
- Application of the alternating direction method of multipliers to separable convex programming problems
- Asymptotic properties of the Fenchel dual functional and applications to decomposition problems
- Clarke Subgradients of Stratifiable Functions
- Convergence of Proximal-Like Algorithms
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Modified extragradient method for variational inequalities and verification of solution existence
- Monotone Operators and the Proximal Point Algorithm
- On semi- and subanalytic geometry
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
Cited in
(11)- scientific article; zbMATH DE number 7640650 (Why is no real title available?)
- Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization
- A new self-adaptive alternating direction method for variational inequality problems with linear equality and inequality constraints
- Iteratively Linearized Reweighted Alternating Direction Method of Multipliers for a Class of Nonconvex Problems
- An alternating iterative method and its application in statistical inference
- An alternating augmented Lagrangian method for constrained nonconvex optimization
- A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems
- Alternating forward-backward splitting for linearly constrained optimization problems
- A new proximal algorithm for unconstrained nonconvex optimization problems
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
- An alternating linearization method with inexact data for bilevel nonsmooth convex optimization
This page was built for publication: A new alternating direction method for linearly constrained nonconvex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496618)
