An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems
From MaRDI portal
Publication:824547
DOI10.1186/s13660-018-1683-1zbMath1497.90158OpenAlexW2799860022MaRDI QIDQ824547
Jinman Lv, Chun-Ming Tang, Jin-Bao Jian
Publication date: 15 December 2021
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-018-1683-1
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Nonsmooth analysis (49J52)
Related Items
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
Cites Work
- Unnamed Item
- Unnamed Item
- Fast alternating linearization methods for minimizing the sum of two convex functions
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- 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
- An algorithm for linearly constrained convex nondifferentiable minimization problems
- Newton's method for convex programming and Tschebyscheff approximation
- A minimization method for the sum of a convex function and a continuously differentiable function
- Methods of descent for nondifferentiable optimization
- A family of projective splitting methods for the sum of two maximal monotone operators
- Introduction to Nonsmooth Optimization
- A proximal alternating linearization method for nonconvex optimization problems
- A Redistributed Proximal Bundle Method for Nonconvex Optimization
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- The Cutting-Plane Method for Solving Convex Programs
- A Method of Centers with Approximate Subgradient Linearizations for Nonsmooth Convex Optimization
- Minimizing the sum of a convex function and a specially structured nonconvex function
- Monotone Operators and the Proximal Point Algorithm
- Variational Analysis
- A Proximal‐Projection Bundle Method for Lagrangian Relaxation, Including Semidefinite Programming
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
