A proximal alternating linearization method for nonconvex optimization problems
From MaRDI portal
Publication:2926053
DOI10.1080/10556788.2013.854358zbMath1298.90070OpenAlexW1985542178MaRDI QIDQ2926053
Dan Li, Li-Ping Pang, Shuang Chen
Publication date: 29 October 2014
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2013.854358
nonsmooth optimizationnonconvex optimizationproximal pointprox-regularalternating linearization algorithmlower-\(\mathcal{C}^{2}\) function
Convex programming (90C25) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Numerical methods based on nonlinear programming (49M37) Decomposition methods (49M27)
Related Items (5)
An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems ⋮ A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems ⋮ An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information ⋮ A Proximal Bundle Method with Exact Penalty Technique and Bundle Modification Strategy for Nonconvex Nonsmooth Constrained Optimization ⋮ Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
Cites Work
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Partial inverse of a monotone operator
- Alternating direction augmented Lagrangian methods for semidefinite programming
- An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems
- Computing proximal points of nonconvex functions
- A method for minimizing the sum of a convex function and a continuously differentiable function
- A minimization method for the sum of a convex function and a continuously differentiable function
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- 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
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- Prox-regular functions in Hilbert spaces
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- Prox-regularity of functions and sets in Banach spaces
- DC programming: overview.
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
- Robust principal component analysis?
- A Redistributed Proximal Bundle Method for Nonconvex Optimization
- Optimization and nonsmooth analysis
- A method of linearizations for linearly constrained nonconvex nonsmooth minimization
- Minimizing the sum of a convex function and a specially structured nonconvex function
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Monotone Operators and the Proximal Point Algorithm
- Variational Analysis
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- Proximal Decomposition Via Alternating Linearization
- Generalized Hessian Properties of Regularized Nonsmooth Functions
- A Method for Minimization of Quasidifferentiable Functions
- Proximal Decomposition on the Graph of a Maximal Monotone Operator
- Prox-regular functions in variational analysis
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
This page was built for publication: A proximal alternating linearization method for nonconvex optimization problems
