A proximal alternating linearization method for nonconvex optimization problems
From MaRDI portal
Recommendations
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- A proximal alternating direction method of multiplier for linearly constrained nonconvex minimization
- A proximal alternating direction method of multipliers for a minimization problem with nonconvex constraints
- A class of linearized proximal alternating direction methods
- Proximal alternating penalty algorithms for nonsmooth constrained convex optimization
- Proximal Decomposition Via Alternating Linearization
- A nonlinear proximal alternating directions method for structured variational inequalities
- A class of alternating linearization algorithms for nonsmooth convex optimization
- A proximal-like algorithm for a class of nonconvex programming
- A proximal iterative approach to a non-convex optimization problem
Cites work
- scientific article; zbMATH DE number 3204910 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Method for Minimization of Quasidifferentiable Functions
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A method for minimizing the sum of a convex function and a continuously differentiable function
- A method of linearizations for linearly constrained nonconvex nonsmooth minimization
- A minimization method for the sum of a convex function and a continuously differentiable function
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- A redistributed proximal bundle method for nonconvex optimization
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems
- Application of the alternating direction method of multipliers to separable convex programming problems
- Computing proximal points of nonconvex functions
- DC programming: overview.
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
- Generalized Hessian Properties of Regularized Nonsmooth Functions
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- Minimizing the sum of a convex function and a specially structured nonconvex function
- Monotone Operators and the Proximal Point Algorithm
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Optimization and nonsmooth analysis
- Partial inverse of a monotone operator
- Prox-regular functions in Hilbert spaces
- Prox-regular functions in variational analysis
- Prox-regularity of functions and sets in Banach spaces
- Proximal Decomposition Via Alternating Linearization
- Proximal Decomposition on the Graph of a Maximal Monotone Operator
- Robust principal component analysis?
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Variational Analysis
Cited in
(25)- A Stochastic Proximal Alternating Minimization for Nonsmooth and Nonconvex Optimization
- An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems
- scientific article; zbMATH DE number 7404502 (Why is no real title available?)
- A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
- Proximal alternating direction method with relaxed proximal parameters for the least squares covariance adjustment problem
- Alternating proximal algorithm for the problem of bi-level convex minimization
- On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
- Proximal linearization methods for Schatten p-quasi-norm minimization
- Inexact proximal penalty alternating linearization decomposition scheme of nonsmooth convex constrained optimization problems
- A proximal bundle method with exact penalty technique and bundle modification strategy for nonconvex nonsmooth constrained optimization
- An approximation proximal gradient algorithm for nonconvex-linear minimax problems with nonconvex nonsmooth terms
- An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information
- The proximal alternating minimization algorithm for two-block separable convex optimization problems with linear constraints
- A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- A class of alternating linearization algorithms for nonsmooth convex optimization
- An alternating linearization method with inexact data for bilevel nonsmooth convex optimization
- Alternating proximal gradient method for convex minimization
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- A proximal alternating linearization method for minimizing the sum of two convex functions
- An alternating semiproximal method for nonconvex regularized structured total least squares problems
- Linear Convergence of a Proximal Alternating Minimization Method with Extrapolation for \(\boldsymbol{\ell_1}\) -Norm Principal Component Analysis
- The PRIMPING routine -- tiling through proximal alternating linearized minimization
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems
This page was built for publication: A proximal alternating linearization method for nonconvex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2926053)
