Pages that link to "Item:Q2483087"

The following pages link to Incorporating nonmonotone strategies into the trust region method for unconstrained optimization (Q2483087):

Displaying 32 items.

• An ODE-like nonmonotone method for nonsmooth convex optimization (Q330379) (← links)
• A nonmonotone trust region method with new inexact line search for unconstrained optimization (Q369443) (← links)
• A model-hybrid approach for unconstrained optimization problems (Q403087) (← links)
• A smoothing Broyden-like method with a nonmonotone derivative-free line search for nonlinear complementarity problems (Q492135) (← links)
• A nonmonotone Levenberg-Marquardt method for nonlinear complementarity problems under local error bound (Q520265) (← links)
• Combining nonmonotone conic trust region and line search techniques for unconstrained optimization (Q629507) (← links)
• A modified nonmonotone trust region line search method (Q721572) (← links)
• An adaptive trust region method based on simple conic models (Q894560) (← links)
• Nonmonotone smoothing Broyden-like method for generalized nonlinear complementarity problems (Q1676990) (← links)
• On the worst-case evaluation complexity of non-monotone line search algorithms (Q1694392) (← links)
• A new regularized quasi-Newton method for unconstrained optimization (Q1800450) (← links)
• A new nonmonotone adaptive trust region line search method for unconstrained optimization (Q1980974) (← links)
• A new nonmonotone trust region Barzilai-Borwein method for unconstrained optimization problems (Q2025210) (← links)
• Two nonmonotone trust region algorithms based on an improved Newton method (Q2053070) (← links)
• A class of accelerated conjugate-gradient-like methods based on a modified secant equation (Q2190281) (← links)
• A hybrid method for solving systems of nonsmooth equations with box constraints (Q2228406) (← links)
• Nonmonotone adaptive trust region method with line search based on new diagonal updating (Q2261939) (← links)
• On efficiency of nonmonotone Armijo-type line searches (Q2284837) (← links)
• An ODE-based nonmonotone method for unconstrained optimization problems (Q2511365) (← links)
• A memory gradient method based on the nonmonotone technique (Q2628189) (← links)
• A class of nonmonotone Armijo-type line search method for unconstrained optimization (Q2903129) (← links)
• A nonmonotone ODE-based method for unconstrained optimization (Q2935398) (← links)
• A nonmonotone scaled conjugate gradient algorithm for large-scale unconstrained optimization (Q5028578) (← links)
• An efficient nonmonotone projected Barzilai–Borwein method for nonnegative matrix factorization with extrapolation (Q5031230) (← links)
• Finding zeros of Hölder metrically subregular mappings via globally convergent Levenberg–Marquardt methods (Q5038173) (← links)
• Nonmonotone conic trust region method with line search technique for bound constrained optimization (Q5242265) (← links)
• A memory gradient method for non-smooth convex optimization (Q5266154) (← links)
• An improved trust region method for unconstrained optimization (Q5890999) (← 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)
• Conditional gradient method for vector optimization (Q6133299) (← links)
• A hybrid BB-type method for solving large scale unconstrained optimization (Q6138335) (← links)
• Convergence of derivative-free nonmonotone direct search methods for unconstrained and box-constrained mixed-integer optimization (Q6175470) (← links)