An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
From MaRDI portal
Publication:4883667
DOI10.1137/S106482759427021XzbMATH Open0849.90113OpenAlexW2012766316WikidataQ58185899 ScholiaQ58185899MaRDI QIDQ4883667FDOQ4883667
Authors: Philippe L. Toint 
Publication date: 2 July 1996
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s106482759427021x
Recommendations
- A new nonmonotone line search technique for unconstrained optimization
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A nonmonotone globalization algorithm with preconditioned gradient path for unconstrained optimization
- On the nonmonotone line search
- General form of nonmonotone line search techniques for unconstrained optimization
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Cited In (only showing first 100 items - show all)
- A Broyden-Fletcher-Goldfarb-Shanno algorithm for reliability-based design optimization
- On efficiency of nonmonotone Armijo-type line searches
- A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems
- A globally convergent BFGS method with nonmonotone line search for non-convex minimization
- Modified nonmonotone Armijo line search for descent method
- Incorporating nonmonotone strategies into the trust region method for unconstrained optimization
- An ODE-based nonmonotone method for unconstrained optimization problems
- An efficient nonmonotone trust-region method for unconstrained optimization
- A class of nonmonotone conjugate gradient methods for nonconvex functions
- A class of nonmonotone armijo-type line search method for unconstrained optimization
- A kind of nonmonotone filter method for nonlinear complementarity problem
- The convergence of conjugate gradient method with nonmonotone line search
- A nonmonotone trust region method with adaptive radius for unconstrained optimization problems
- A hybrid of adjustable trust-region and nonmonotone algorithms for unconstrained optimization
- A derivative-free nonmonotone line-search technique for unconstrained optimization
- A nonmonotone hybrid method for nonlinear systems∗
- An efficient Levenberg–Marquardt method with a new LM parameter for systems of nonlinear equations
- An adaptive nonmonotone trust-region method with curvilinear search for minimax problem
- Nonmonotone trust-region method for nonlinear programming with general constraints and simple bounds
- A non-monotone pattern search approach for systems of nonlinear equations
- Nonmonotone line search methods with variable sample size
- Non-monotone projection gradient method for non-negative matrix factorization
- A new trust region method for solving least-square transformation of system of equalities and inequalities
- A class of nonmonotone conjugate gradient methods for unconstrained optimization
- Global convergence of algorithms with nonmonotone line search strategy in unconstrained optimization
- A modified nonmonotone trust region line search method
- An adaptive nonmonotone line search for multiobjective optimization problems
- A nonmonotone line search method and its convergence for unconstrained optimization
- A nonmonotone adaptive trust region method and its convergence
- A relaxed nonmonotone adaptive trust region method for solving unconstrained optimization problems
- Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization
- A new family of conjugate gradient methods
- Nonmonotone trust region method for solving optimization problems
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Two accelerated nonmonotone adaptive trust region line search methods
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
- A modified SQP method with nonmonotone technique and its global convergence
- Nonmonotone second-order Wolfe's line search method for unconstrained optimization problems
- A new nonmonotone adaptive retrospective trust region method for unconstrained optimization problems
- A nonmonotone line search filter method with reduced Hessian updating for nonlinear optimization
- An ODE-like nonmonotone method for nonsmooth convex optimization
- Two globally convergent nonmonotone trust-region methods for unconstrained optimization
- An unconstrained optimization method using nonmonotone second order Goldstein's line search
- A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function values
- Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem
- LMBOPT: a limited memory method for bound-constrained optimization
- Nonmonotone algorithm for minimization on closed sets with applications to minimization on Stiefel manifolds
- On the nonmonotone line search
- Modified subspace Barzilai-Borwein gradient method for non-negative matrix factorization
- A modified non-monotone BFGS method for non-convex unconstrained optimization
- Global convergence of nonmonotone descent methods for unconstrained optimization problems
- A new nonmonotone line search technique for unconstrained optimization
- A feasible filter method for the nearest low-rank correlation matrix problem
- Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization
- A nonmonotone trust-region line search method for large-scale unconstrained optimization
- A nonmonotone trust region method with new inexact line search for unconstrained optimization
- Parallel variable distribution algorithm for constrained optimization with nonmonotone technique
- Title not available (Why is that?)
- A new nonmonotone trust-region method of conic model for solving unconstrained optimization
- Nonmonotone adaptive trust region method based on simple conic model for unconstrained optimization
- A modified nonmonotone BFGS algorithm for unconstrained optimization
- Spectral residual methods with two new non-monotone line searches for large-scale nonlinear systems of equations
- A robust implementation of a sequential quadratic programming algorithm with successive error restoration
- An extended nonmonotone line search technique for large-scale unconstrained optimization
- An inexact line search approach using modified nonmonotone strategy for unconstrained optimization
- Nonmonotone algorithm for minimax optimization problems
- Convergence of descent method with new line search
- Nonmonotone adaptive trust-region method for unconstrained optimization problems
- Numerical research on the sensitivity of nonmonotone trust region algorithms to their parameters
- A new nonmonotone line search technique for unconstrained optimization
- A nonmonotone supermemory gradient algorithm for unconstrained optimization
- A nonmonotone scaled conjugate gradient algorithm for large-scale unconstrained optimization
- Global convergence of conjugate gradient method
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
- A nonmonotone gradient method for constrained multiobjective optimization problems
- An adaptive nonmonotone global Barzilai–Borwein gradient method for unconstrained optimization
- A nonmonotone adaptive trust region technique with a forgetting factor
- On the convergence rate of scaled gradient projection method
- Two modified adaptive cubic regularization algorithms by using the nonmonotone Armijo-type line search
- Global convergence of a nonmonotone Broyden family method for nonconvex unconstrained minimization
- A memory gradient method based on the nonmonotone technique
- Combination adaptive trust region method by non-monotone strategy for unconstrained nonlinear programming
- Accelerated nonmonotone line search technique for multiobjective optimization
- A stabilized simulated annealing based Barzilai-Borwein method for the solution of unconstrained optimization problems
- A nonmonotone Broyden method for unconstrained optimization
- A new class of nonmonotone adaptive trust-region methods for nonlinear equations with box constraints
- A modified ODE-based algorithm for unconstrained optimization problems
- Inexact Newton-type methods based on Lanczos orthonormal method and application for full waveform inversion
- A new adaptive Levenberg-Marquardt parameter with a nonmonotone and trust region strategies for the system of nonlinear equations
- An adaptive nonmonotone trust region algorithm
- On determining radius in nonmonotone trust-region approaches
- A nonmonotonic hybrid algorithm for min-max problem
- A new nonmonotone spectral projected gradient algorithm for box-constrained optimization problems in \(m \times n\) real matrix space with application in image clustering
- Correction of nonmonotone trust region algorithm based on a modified diagonal regularized quasi-Newton method
- A modified HS-DY-type method with nonmonotone line search for image restoration and unconstrained optimization problems
- Some theoretical properties of Feng-Schnabel algorithm for block bordered nonlinear systems
- Non monotone algorithms for unconstrained minimization: upper bounds on function values
- Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization
- A nonmonotone ODE-based method for unconstrained optimization
- A new nonmonotone line search method for nonsmooth nonconvex optimization
Uses Software
This page was built for publication: An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4883667)
