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

DOI10.1007/BF02612712zbMath0528.49024MaRDI QIDQ3310490

Robert Mifflin

Publication date: 1984

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

nonsmooth optimizationsuperlinear convergenceconstrained minimizationline searchlocally Lipschitz functionspolyhedral and quadratic approximation

Mathematics Subject Classification ID

Related Items (10)

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

Cites Work

• Optimization of upper semidifferentiable functions
• A Superlinearly Convergent Algorithm for One-Dimensional Constrained Minimization Problems with Convex Functions
• Generalized Gradients and Applications
• Semismooth and Semiconvex Functions in Constrained Optimization
• Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions
• Convex Analysis
• Unnamed Item

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