An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems
DOI10.1186/S13660-018-1683-1zbMATH Open1497.90158OpenAlexW2799860022MaRDI QIDQ824547FDOQ824547
Authors: Jinman Lv, Chun-Ming Tang, Jinbao 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
Recommendations
- An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information
- A proximal alternating linearization method for nonconvex optimization problems
- A class of alternating linearization algorithms for nonsmooth convex optimization
- A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems
- Piecewise linear approximations in nonconvex nonsmooth optimization
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Nonsmooth analysis (49J52)
Cites Work
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Variational Analysis
- Fast alternating linearization methods for minimizing the sum of two convex functions
- 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
- 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
- Methods of descent for nondifferentiable optimization
- A redistributed proximal bundle method for nonconvex optimization
- Monotone Operators and the Proximal Point Algorithm
- Title not available (Why is that?)
- A family of projective splitting methods for the sum of two maximal monotone operators
- The Cutting-Plane Method for Solving Convex Programs
- An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems
- Computing proximal points of nonconvex functions
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- Newton's method for convex programming and Tschebyscheff approximation
- Title not available (Why is that?)
- A proximal alternating linearization method for nonconvex optimization problems
- A Method of Centers with Approximate Subgradient Linearizations for Nonsmooth Convex Optimization
- An algorithm for linearly constrained convex nondifferentiable minimization problems
- Introduction to nonsmooth optimization. Theory, practice and software
- A Proximal‐Projection Bundle Method for Lagrangian Relaxation, Including Semidefinite Programming
- Minimizing the sum of a convex function and a specially structured nonconvex function
Cited In (7)
- An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems
- An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information
- A class of alternating linearization algorithms for nonsmooth convex optimization
- An alternating linearization method with inexact data for bilevel nonsmooth convex optimization
- A splitting bundle approach for non-smooth non-convex minimization
- Gradient set splitting in nonconvex nonsmooth numerical optimization
- A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems
This page was built for publication: An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q824547)
