The following pages link to On the nonmonotone line search (Q5959912):
Displaying 50 items.
- An ODE-like nonmonotone method for nonsmooth convex optimization (Q330379) (← links)
- Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem (Q343664) (← links)
- A nonmonotone trust region method with new inexact line search for unconstrained optimization (Q369443) (← links)
- Nonmonotone algorithm for minimization on closed sets with applications to minimization on Stiefel manifolds (Q408215) (← links)
- An efficient nonmonotone trust-region method for unconstrained optimization (Q411524) (← links)
- Preconditioning non-monotone gradient methods for retrieval of seismic reflection signals (Q421375) (← links)
- Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search (Q479230) (← links)
- A feasible filter method for the nearest low-rank correlation matrix problem (Q494667) (← links)
- Modified nonmonotone Armijo line search for descent method (Q535246) (← links)
- A robust implementation of a sequential quadratic programming algorithm with successive error restoration (Q537640) (← links)
- The convergence of conjugate gradient method with nonmonotone line search (Q606706) (← links)
- A non-monotone line search algorithm for unconstrained optimization (Q618548) (← links)
- Nonmonotone adaptive trust region method (Q621656) (← links)
- Scalar correction method for solving large scale unconstrained minimization problems (Q658551) (← links)
- A new class of nonmonotone conjugate gradient training algorithms (Q669374) (← links)
- A filter trust-region algorithm for unconstrained optimization with strong global convergence properties (Q694595) (← links)
- A nonmonotone PSB algorithm for solving unconstrained optimization (Q694601) (← links)
- A nonmonotone supermemory gradient algorithm for unconstrained optimization (Q741395) (← links)
- Hybrid spectral gradient method for the unconstrained minimization problem (Q839039) (← links)
- New inexact line search method for unconstrained optimization (Q850832) (← links)
- Strong global convergence of an adaptive nonmonotone memory gradient method (Q870222) (← links)
- Multivariate spectral gradient method for unconstrained optimization (Q945298) (← links)
- Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization (Q953368) (← links)
- Notes on the Dai-Yuan-Yuan modified spectral gradient method (Q984907) (← links)
- A globally convergent BFGS method with nonmonotone line search for non-convex minimization (Q1026434) (← links)
- Nonmonotone line search for minimax problems (Q1321311) (← links)
- A new class of nonmonotone adaptive trust-region methods for nonlinear equations with box constraints (Q1675425) (← links)
- An extended nonmonotone line search technique for large-scale unconstrained optimization (Q1675990) (← links)
- Nonmonotone gradient methods for vector optimization with a portfolio optimization application (Q1694908) (← links)
- On the nonmonotonicity degree of nonmonotone line searches (Q1697277) (← links)
- Two modified three-term type conjugate gradient methods and their global convergence for unconstrained optimization (Q1718269) (← links)
- Efficient projected gradient methods for cardinality constrained optimization (Q1729947) (← links)
- Semismooth Newton methods with domain decomposition for American options (Q1747290) (← links)
- Steplength selection in gradient projection methods for box-constrained quadratic programs (Q2009551) (← links)
- Scalar correction method for finding least-squares solutions on Hilbert spaces and its applications (Q2016276) (← links)
- A new trust region method for solving least-square transformation of system of equalities and inequalities (Q2017830) (← links)
- On the inexact scaled gradient projection method (Q2070333) (← links)
- A nonmonotone scaled Fletcher-Reeves conjugate gradient method with application in image reconstruction (Q2091131) (← links)
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization (Q2114598) (← links)
- LMBOPT: a limited memory method for bound-constrained optimization (Q2146448) (← links)
- Global convergence of a nonmonotone Broyden family method for nonconvex unconstrained minimization (Q2167421) (← links)
- A class of accelerated conjugate-gradient-like methods based on a modified secant equation (Q2190281) (← links)
- Non-monotone inexact restoration method for nonlinear programming (Q2191795) (← links)
- A Riemannian nonmonotone spectral method for self-adjoint tangent vector field (Q2227739) (← links)
- A modified ODE-based algorithm for unconstrained optimization problems (Q2248961) (← links)
- Nonmonotone adaptive trust region method based on simple conic model for unconstrained optimization (Q2258098) (← links)
- On efficiency of nonmonotone Armijo-type line searches (Q2284837) (← links)
- A nonmonotone smoothing Newton method for system of nonlinear inequalities based on a new smoothing function (Q2322485) (← links)
- Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems (Q2329657) (← links)
- Nonmonotone line search methods with variable sample size (Q2340358) (← links)
