Pages that link to "Item:Q4883667"
From MaRDI portal
The following pages link to An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization (Q4883667):
Displaying 50 items.
- A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems (Q295480) (← links)
- 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)
- Modified subspace Barzilai-Borwein gradient method for non-negative matrix factorization (Q354621) (← 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)
- Non-monotone projection gradient method for non-negative matrix factorization (Q429483) (← 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)
- A kind of nonmonotone filter method for nonlinear complementarity problem (Q545563) (← links)
- The convergence of conjugate gradient method with nonmonotone line search (Q606706) (← links)
- A nonmonotone trust region method with adaptive radius for unconstrained optimization problems (Q611316) (← links)
- Nonmonotone second-order Wolfe's line search method for unconstrained optimization problems (Q623198) (← links)
- Nonmonotone algorithm for minimax optimization problems (Q632859) (← links)
- Spectral residual methods with two new non-monotone line searches for large-scale nonlinear systems of equations (Q668640) (← links)
- Global convergence of nonmonotone descent methods for unconstrained optimization problems (Q697549) (← links)
- A class of nonmonotone conjugate gradient methods for nonconvex functions (Q698383) (← links)
- A modified nonmonotone trust region line search method (Q721572) (← links)
- A nonmonotone supermemory gradient algorithm for unconstrained optimization (Q741395) (← links)
- Convergence of descent method with new line search (Q815995) (← links)
- A Broyden-Fletcher-Goldfarb-Shanno algorithm for reliability-based design optimization (Q823309) (← links)
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization (Q849145) (← links)
- Nonmonotone trust-region method for nonlinear programming with general constraints and simple bounds (Q852152) (← links)
- A new nonmonotone adaptive retrospective trust region method for unconstrained optimization problems (Q896192) (← links)
- Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization (Q953368) (← links)
- A globally convergent BFGS method with nonmonotone line search for non-convex minimization (Q1026434) (← links)
- A modified SQP method with nonmonotone technique and its global convergence (Q1029867) (← links)
- A class of nonmonotone conjugate gradient methods for unconstrained optimization (Q1293956) (← links)
- Global convergence of algorithms with nonmonotone line search strategy in unconstrained optimization (Q1411546) (← links)
- A hybrid of adjustable trust-region and nonmonotone algorithms for unconstrained optimization (Q1630201) (← links)
- Two accelerated nonmonotone adaptive trust region line search methods (Q1652801) (← 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)
- Nonmonotone adaptive trust-region method for unconstrained optimization problems (Q1774954) (← links)
- A nonmonotone adaptive trust region method and its convergence (Q1827231) (← links)
- Nonmonotone trust region method for solving optimization problems (Q1886565) (← 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)
- Non-monotone inexact restoration method for nonlinear programming (Q2191795) (← 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)
