Pages that link to "Item:Q2284837"

The following pages link to On efficiency of nonmonotone Armijo-type line searches (Q2284837):

Displaying 14 items.

• Impulse noise removal by an adaptive trust-region method (Q780152) (← links)
• A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems (Q1649149) (← links)
• An extended nonmonotone line search technique for large-scale unconstrained optimization (Q1675990) (← links)
• Optimal subgradient algorithms for large-scale convex optimization in simple domains (Q1689457) (← links)
• A generalized worst-case complexity analysis for non-monotone line searches (Q2028039) (← links)
• An extended projected residual algorithm for solving smooth convex optimization problems (Q2141614) (← links)
• An efficient nonmonotone method for state-constrained elliptic optimal control problems (Q2196416) (← links)
• Secant update version of quasi-Newton PSB with weighted multisecant equations (Q2301143) (← links)
• Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity (Q2311123) (← links)
• A nonmonotone inexact Newton method for unconstrained optimization (Q2359404) (← links)
• A nonmonotone line search method for stochastic optimization problems (Q5086883) (← links)
• A new nonmonotone spectral projected gradient algorithm for box-constrained optimization problems in \(m \times n\) real matrix space with application in image clustering (Q6056240) (← links)
• Nonmonotone quasi-Newton-based conjugate gradient methods with application to signal processing (Q6109887) (← links)
• Conditional gradient method for vector optimization (Q6133299) (← links)