A class on nonmonotone stabilization methods in unconstrained optimization
From MaRDI portal
Publication:2277146
This paper deals with the solution of smooth unconstrained minimization problems by Newton-type methods whose global convergence is enforced by means of a nonmonotone stabilization strategy. In particular, a stabilization scheme is analyzed, which includes different kinds of relaxation of the descent requirements. An extensive numerical experimentation is reported.
Recommendations
- A class of nonmonotone stabilization trust region methods
- A quasi-discrete Newton algorithm with a nonmonotone stabilization technique
- A nonmonotone globalization algorithm with preconditioned gradient path for unconstrained optimization
- Global convergence of nonmonotone descent methods for unconstrained optimization problems
- A class of nonmonotone trust region algorithms for unconstrained optimization problems
Cites work
- A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
- A globally and quadratically convergent algorithm for general nonlinear programming problems
- A Nonmonotone Line Search Technique for Newton’s Method
- A quasi-discrete Newton algorithm with a nonmonotone stabilization technique
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- scientific article; zbMATH DE number 3984475 (Why is no real title available?)
- scientific article; zbMATH DE number 4068627 (Why is no real title available?)
- scientific article; zbMATH DE number 3658896 (Why is no real title available?)
- scientific article; zbMATH DE number 3709946 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- Newton-type methods for unconstrained and linearly constrained optimization
- On the globalization of Wilson-type optimization methods by means of generalized reduced gradient methods
- Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
- Test examples for nonlinear programming codes
- Testing Unconstrained Optimization Software
- The watchdog technique for forcing convergence in algorithms for constrained optimization
- Truncated-Newton algorithms for large-scale unconstrained optimization
Cited in
(67)- 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 algorithms with nonmonotone line search strategy in unconstrained optimization
- Global convergence of nonmonotone strategies in parallel methods for block-bordered nonlinear systems
- 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
- On the nonmonotonicity degree of nonmonotone line searches
- A new descent algorithm with curve search rule
- Nonmonotone adaptive trust-region method for unconstrained optimization problems
- A quasi-discrete Newton algorithm with a nonmonotone stabilization technique
- A survey of gradient methods for solving nonlinear optimization
- On efficiency of nonmonotone Armijo-type line searches
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs
- Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems
- Nonmonotone line search methods with variable sample size
- A nonmonotone inexact Newton method for unconstrained optimization
- A two-stage active-set algorithm for bound-constrained optimization
- A modified nonmonotone BFGS algorithm for unconstrained optimization
- An inexact line search approach using modified nonmonotone strategy for unconstrained optimization
- Memory gradient method with Goldstein line search
- On memory gradient method with trust region for unconstrained optimization
- A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations
- Convergence of descent method without line search
- A new super-memory gradient method with curve search rule
- A new nonmonotone filter Barzilai–Borwein method for solving unconstrained optimization problems
- 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
- A nonmonotone filter SQP method: local convergence and numerical results
- A line search trust-region algorithm with nonmonotone adaptive radius for a system of nonlinear equations
- Assessing the potential of interior point barrier filter line search methods: nonmonotone versus monotone approach
- Nonmonotone learning of recurrent neural networks in symbolic sequence processing applications
- Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem
- On the global convergence of a nonmonotone proximal bundle method for convex nonsmooth minimization
- A nonmonotone filter Barzilai-Borwein method for optimization
- Solving nonlinear systems of equations by means of quasi-neston methods with a nonmonotone stratgy∗
- A nonmonotone hybrid method for nonlinear systems∗
- A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
- A new class of memory gradient methods with inexact line searches
- Some theoretical properties of Feng-Schnabel algorithm for block bordered nonlinear systems
- An Infeasible Interior-Point Method with Nonmonotonic Complementarity Gaps
- A variant of curved search method
- Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search
- Cost approximation algorithms with nonmonotone line searches for a general class of nonlinear programs
- A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem
- An improved adaptive trust-region method for unconstrained optimization
- A trust-region approach with novel filter adaptive radius for system of nonlinear equations
- A non-monotone pattern search approach for systems of nonlinear equations
- Total variation based community detection using a nonlinear optimization approach
- Inexact Newton-type methods based on Lanczos orthonormal method and application for full waveform inversion
- A trust-region method using extended nonmonotone technique for unconstrained optimization
- Practical implementation of an interior point nonmonotone line search filter method
- Essentials of numerical nonsmooth optimization
- A new nonmonotone line search technique for unconstrained optimization
- On the nonmonotone line search
- A gradient-related algorithm with inexact line searches
- Essentials of numerical nonsmooth optimization
- Use of the minimum norm search direction in a nonmonotone version of the Gauss-Newton method
- A new nonmonotone spectral projected gradient algorithm for box-constrained optimization problems in m n real matrix space with application in image clustering
- On determining radius in nonmonotone trust-region approaches
- Quantifying the structural stability of simplicial homology
- A nonmonotone globalization algorithm with preconditioned gradient path for unconstrained optimization
- Nonmonotone second-order Wolfe's line search method for unconstrained optimization problems
- Spectral projected gradient method for stochastic optimization
- An approach based on dwindling filter method for positive definite generalized eigenvalue problem
- A modified nonmonotone BFGS algorithm for solving smooth nonlinear equations
- Nonmonotone trust-region method for nonlinear programming with general constraints and simple bounds
- A new class of supermemory gradient methods
This page was built for publication: A class on nonmonotone stabilization methods in unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277146)
