Global convergence of quasi-Newton-type algorithms for some nonsmooth optimization problems

DOI10.1007/BF00933937zbMath0488.49016OpenAlexW2057876902MaRDI QIDQ1166101

Ekkehard W. Sachs

Publication date: 1983

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00933937

zbMATH Keywords

global convergencenonsmooth optimizationquasi-Newton methodsChebyshev approximation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Newton-type methods (49M15) Numerical methods based on nonlinear programming (49M37) Best approximation, Chebyshev systems (41A50)

Related Items (4)

Broyden's method in Hilbert space ⋮ Mesh independence of Newton-like methods for infinite dimensional problems ⋮ Characterization of bang-bang principles ⋮ Optimal control problems in diffusion processes with a nonsmooth nonlinear boundary condition

Cites Work

• Unnamed Item
• Unnamed Item
• Nonlinear optimization and approximation
• On the convergence of a class of nonlinear approximation methods
• Eine Klasse von Verfahren zur Ermittlung bester nichtlinearer Tschebyscheff-Approximationen
• On regularly convex sets in the space conjugate to a Banach space
• Variable metric methods for minimizing a class of nondifferentiable functions
• Combined lp and quasi-Newton methods for minimax optimization
• An Algorithm for the Chebyshev Problem—With an Application to Concave Programming

This page was built for publication: Global convergence of quasi-Newton-type algorithms for some nonsmooth optimization problems