Decomposition Methods for Computing Directional Stationary Solutions of a Class of Nonsmooth Nonconvex Optimization Problems
From MaRDI portal
Publication:4641680
DOI10.1137/17M1110249zbMath1397.90316OpenAlexW2803197818MaRDI QIDQ4641680
Publication date: 18 May 2018
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/17m1110249
convergence analysisnonconvex optimizationblock coordinate descent methodalternating direction method of multipliersBregman regularizationdirectional stationary points
Related Items
A decomposition method for a class of convex generalized Nash equilibrium problems, Minimization of $L_1$ Over $L_2$ for Sparse Signal Recovery with Convergence Guarantee, Consistency bounds and support recovery of d-stationary solutions of sparse sample average approximations, A Scale-Invariant Approach for Sparse Signal Recovery, A parametrized variational inequality approach to track the solution set of a generalized Nash equilibrium problem, Perturbed iterate SGD for Lipschitz continuous loss functions, Limited-Angle CT Reconstruction via the $L_1/L_2$ Minimization, Stochastic Difference-of-Convex-Functions Algorithms for Nonconvex Programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Alternating direction method of multipliers for penalized zero-variance discriminant analysis
- On the convergence properties of a majorized alternating direction method of multipliers for linearly constrained convex optimization problems with coupled objective functions
- Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\)
- An alternating direction algorithm for matrix completion with nonnegative factors
- Decomposition algorithms for generalized potential games
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Global convergence of ADMM in nonconvex nonsmooth optimization
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Coordinate descent algorithms
- Transactions on Computational Collective Intelligence XIII
- Splitting Methods in Communication, Imaging, Science, and Engineering
- A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
- Hankel Matrix Rank Minimization with Applications to System Identification and Realization
- Constrained Total Variation Deblurring Models and Fast Algorithms Based on Alternating Direction Method of Multipliers
- A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
- Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
- Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization
- Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
- Computing B-Stationary Points of Nonsmooth DC Programs
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- Alternating direction methods for classical and ptychographic phase retrieval
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- The Linear Complementarity Problem
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Variational Analysis
- A New Decomposition Method for Multiuser DC-Programming and Its Applications
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Iterative Solution of Nonlinear Equations in Several Variables
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
- Alternating direction method of multipliers for real and complex polynomial optimization models
- A splitting method for separable convex programming
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity
- Linearized Alternating Direction Method of Multipliers for Constrained Linear Least-Squares Problem
- Convex Analysis
