A Linearization Algorithm for Nonsmooth Minimization

DOI10.1287/MOOR.10.2.185MaRDI QIDQ3680622zbMATH OpenOpenAlexFDO

Authors Krzysztof C. Kiwiel

Publication date 1985

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.10.2.185

zbMATH Keywords

global convergencestationary pointsnonsmooth minimizationlocally Lipschitzian functionsaggregate subgradient method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Recommendations

• A method of linearizations for linearly constrained nonconvex nonsmooth minimization
• scientific article; zbMATH DE number 4045492
• scientific article; zbMATH DE number 3916028
• An algorithm for linearly constrained convex nondifferentiable minimization problems
• An Algorithm for Nonsmooth Convex Minimization With Errors

Cited in

(25)

• scientific article; zbMATH DE number 16326 (Why is no real title available?)
• scientific article; zbMATH DE number 4045492 (Why is no real title available?)
• Nonsmooth nonconvex optimization on Riemannian manifolds via bundle trust region algorithm
• Optimal Convergence Rates for the Proximal Bundle Method
• Bundle trust region algorithm based on linear subproblem
• A method for minimizing the sum of a convex function and a continuously differentiable function
• Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems
• A bundle-type auxiliary problem method for solving generalized variational-like inequalities
• A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
• A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
• The linearized version of an algorithm for the mixed norms problem
• An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space
• A proximal bundle method for nonsmooth nonconvex functions with inexact information
• Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions
• A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information
• scientific article; zbMATH DE number 3916028 (Why is no real title available?)
• An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions
• A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions
• Constrained nonconvex nonsmooth optimization via proximal bundle method
• A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective
• A method of linearizations for linearly constrained nonconvex nonsmooth minimization
• An aggregate subgradient method for nonsmooth and nonconvex minimization
• scientific article; zbMATH DE number 3874967 (Why is no real title available?)
• The bundle scheme for solving arbitrary eigenvalue optimizations
• Linearly constrained nonsmooth and nonconvex minimization

This page was built for publication: A Linearization Algorithm for Nonsmooth Minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3680622)