A class on nonmonotone stabilization methods in unconstrained optimization

DOI10.1007/BF01385810zbMath0724.90060OpenAlexW2118700449MaRDI QIDQ2277146

Stefano Lucidi, Luigi Grippo, Francesco Lampariello

Publication date: 1991

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/133579

zbMATH Keywords

global convergenceNewton-type methodssmooth unconstrained minimizationnonmonotone stabilization strategy

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (66)

A non-monotone pattern search approach for systems of nonlinear equations ⋮ A nonmonotone inexact Newton method for unconstrained optimization ⋮ A two-stage active-set algorithm for bound-constrained optimization ⋮ A line search trust-region algorithm with nonmonotone adaptive radius for a system of nonlinear equations ⋮ A class of nonmonotone Armijo-type line search method for unconstrained optimization ⋮ A non-monotone trust region algorithm for unconstrained optimization with dynamic reference iteration updates using filter ⋮ Nonmonotone trust-region method for nonlinear programming with general constraints and simple bounds ⋮ Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem ⋮ A new class of supermemory gradient methods ⋮ A modified nonmonotone BFGS algorithm for unconstrained optimization ⋮ A gradient-related algorithm with inexact line searches ⋮ Use of the minimum norm search direction in a nonmonotone version of the Gauss-Newton method ⋮ A new class of nonmonotone adaptive trust-region methods for nonlinear equations with box constraints ⋮ An extended nonmonotone line search technique for large-scale unconstrained optimization ⋮ A Nonmonotone Filter SQP Method: Local Convergence and Numerical Results ⋮ A nonmonotone globalization algorithm with preconditioned gradient path for unconstrained optimization ⋮ A new nonmonotone spectral projected gradient algorithm for box-constrained optimization problems in \(m \times n\) real matrix space with application in image clustering ⋮ Nonmonotone second-order Wolfe's line search method for unconstrained optimization problems ⋮ On the nonmonotonicity degree of nonmonotone line searches ⋮ Quantifying the structural stability of simplicial homology ⋮ Total Variation Based Community Detection Using a Nonlinear Optimization Approach ⋮ Global convergence of algorithms with nonmonotone line search strategy in unconstrained optimization ⋮ Unnamed Item ⋮ Inexact Newton-type methods based on Lanczos orthonormal method and application for full waveform inversion ⋮ A survey of gradient methods for solving nonlinear optimization ⋮ On the global convergence of a nonmonotone proximal bundle method for convex nonsmooth minimization ⋮ An inexact line search approach using modified nonmonotone strategy for unconstrained optimization ⋮ Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search ⋮ Spectral projected gradient method for stochastic optimization ⋮ A trust-region approach with novel filter adaptive radius for system of nonlinear equations ⋮ A NONMONOTONE FILTER BARZILAI-BORWEIN METHOD FOR OPTIMIZATION ⋮ Memory gradient method with Goldstein line search ⋮ Solving nonlinear systems of equations by means of quasi-neston methods with a nonmonotone stratgy^∗ ⋮ A new descent algorithm with curve search rule ⋮ A new nonmonotone line search technique for unconstrained optimization ⋮ On memory gradient method with trust region for unconstrained optimization ⋮ A new class of memory gradient methods with inexact line searches ⋮ Nonmonotone adaptive trust-region method for unconstrained optimization problems ⋮ Cost approximation algorithms with nonmonotone line searches for a general class of nonlinear programs ⋮ An approach based on dwindling filter method for positive definite generalized eigenvalue problem ⋮ On the nonmonotone line search ⋮ On efficiency of nonmonotone Armijo-type line searches ⋮ A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations ⋮ A new nonmonotone filter Barzilai–Borwein method for solving unconstrained optimization problems ⋮ Practical implementation of an interior point nonmonotone line search filter method ⋮ Some theoretical properties of Feng-Schnabel algorithm for block bordered nonlinear systems ⋮ Essentials of numerical nonsmooth optimization ⋮ A modified nonmonotone BFGS algorithm for solving smooth nonlinear equations ⋮ A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs ⋮ An Infeasible Interior-Point Method with Nonmonotonic Complementarity Gaps ⋮ A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem ⋮ A globally convergent BFGS method with nonmonotone line search for non-convex minimization ⋮ A modified SQP method with nonmonotone technique and its global convergence ⋮ Global convergence of nonmonotone strategies in parallel methods for block-bordered nonlinear systems ⋮ Nonmonotone Learning of Recurrent Neural Networks in Symbolic Sequence Processing Applications ⋮ Assessing the potential of interior point barrier filter line search methods: nonmonotoneversusmonotone approach ⋮ Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems ⋮ Convergence of descent method without line search ⋮ A new super-memory gradient method with curve search rule ⋮ AN IMPROVED ADAPTIVE TRUST-REGION METHOD FOR UNCONSTRAINED OPTIMIZATION ⋮ Nonmonotone line search methods with variable sample size ⋮ A nonmonotone hybrid method for nonlinear systems^∗ ⋮ Essentials of numerical nonsmooth optimization ⋮ Unnamed Item ⋮ A variant of curved search method ⋮ A derivative-free line search and global convergence of Broyden-like method for nonlinear equations

Uses Software

• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the globalization of Wilson-type optimization methods by means of generalized reduced gradient methods
• A truncated Newton method with non-monotone line search for unconstrained optimization
• Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
• Test examples for nonlinear programming codes
• A globally and quadratically convergent algorithm for general nonlinear programming problems
• A quasi-discrete Newton algorithm with a nonmonotone stabilization technique
• Truncated-Newton algorithms for large-scale unconstrained optimization
• Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
• A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
• Testing Unconstrained Optimization Software
• The watchdog technique for forcing convergence in algorithms for constrained optimization
• Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
• Newton-type methods for unconstrained and linearly constrained optimization
• A Nonmonotone Line Search Technique for Newton’s Method

This page was built for publication: A class on nonmonotone stabilization methods in unconstrained optimization