Stationarity and superlinear convergence of an algorithm for univariate locally lipschitz constrained minimization

DOI10.1007/BF02612712MaRDI QIDQ3310490zbMATH OpenFDO

Authors Robert Mifflin

Publication date 1984

Published in Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

nonsmooth optimizationconstrained minimizationline searchlocally Lipschitz functionssuperlinear convergencepolyhedral and quadratic approximation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Polytopes and polyhedra (52Bxx) Nondifferentiability (nondifferentiable functions, points of nondifferentiability), discontinuous derivatives (26A27)

Cites work

• scientific article; zbMATH DE number 3496814 (Why is no real title available?)
• A Superlinearly Convergent Algorithm for One-Dimensional Constrained Minimization Problems with Convex Functions
• Convex Analysis
• Generalized Gradients and Applications
• Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions
• Optimization of upper semidifferentiable functions
• Semismooth and Semiconvex Functions in Constrained Optimization

Cited in

(10)

• Essentials of numerical nonsmooth optimization
• A quadratic approximation method for minimizing a class of quasidifferentiable functions
• A bracketing technique to ensure desirable convergence in univariate minimization
• A rapidly convergent five-point algorithm for univariate minimization
• Essentials of numerical nonsmooth optimization
• A globalization scheme for the generalized Gauss-Newton method
• A quasi-second-order proximal bundle algorithm
• On superlinear convergence in univariate nonsmooth minimization
• An active set method for solving linearly constrained nonsmooth optimization problems
• A derivative-based bracketing scheme for univariate minimization and the conjugate gradient method

This page was built for publication: Stationarity and superlinear convergence of an algorithm for univariate locally lipschitz constrained minimization

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