Global convergence and stabilization of unconstrained minimization methods without derivatives

DOI10.1007/BF00939550zbMath0619.90063OpenAlexW2037504242MaRDI QIDQ1090237

Francesco Lampariello, Stefano Lucidi, Luigi Grippo

Publication date: 1988

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

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

zbMATH Keywords

global stabilizationunconstrained minimizationline searchnonderivative methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items

Globally convergent block-coordinate techniques for unconstrained optimization, Extended global convergence framework for unconstrained optimization, Nonmonotone derivative-free methods for nonlinear equations, Perturbed steepest-descent technique in multiextremal problems, Convergence conditions, line search algorithms and trust region implementations for the Polak–Ribière conjugate gradient method, A globally convergent version of the Polak-Ribière conjugate gradient method, A robust optimization approach for magnetic spacecraft attitude stabilization, Frame-based ray search algorithms in unconstrained optimization, A local search method for costly black-box problems and its application to CSP plant start-up optimization refinement, On convergence analysis of a derivative-free trust region algorithm for constrained optimization with separable structure, Optimizing partially separable functions without derivatives, Global convergence technique for the Newton method with periodic Hessian evaluation, A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations, A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints, Derivative-free optimization methods

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An effective algorithm for minimization
• Stopping criteria for linesearch methods without derivatives
• A note on a sufficient-decrease criterion for a non-derivative step-length procedure
• A superlinearly convergent algorithm for minimization without evaluating derivatives
• A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods