An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems
From MaRDI portal
(Redirected from Publication:824547)
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
Cites work
- scientific article; zbMATH DE number 3559294 (Why is no real title available?)
- scientific article; zbMATH DE number 3577030 (Why is no real title available?)
- A Method of Centers with Approximate Subgradient Linearizations for Nonsmooth Convex Optimization
- A Proximal‐Projection Bundle Method for Lagrangian Relaxation, Including Semidefinite Programming
- A family of projective splitting methods for the sum of two maximal monotone operators
- 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
- A proximal alternating linearization method for nonconvex optimization problems
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- A redistributed proximal bundle method for nonconvex optimization
- An algorithm for linearly constrained convex nondifferentiable minimization problems
- An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems
- Computing proximal points of nonconvex functions
- Fast alternating linearization methods for minimizing the sum of two convex functions
- Introduction to nonsmooth optimization. Theory, practice and software
- Methods of descent for nondifferentiable optimization
- Minimizing the sum of a convex function and a specially structured nonconvex function
- Monotone Operators and the Proximal Point Algorithm
- Newton's method for convex programming and Tschebyscheff approximation
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- 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
- The Cutting-Plane Method for Solving Convex Programs
- Variational Analysis
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)
