Pages that link to "Item:Q5919724"

The following pages link to A new nonmonotone line search technique for unconstrained optimization (Q5919724):

Displaying 35 items.

• A new nonmonotone spectral residual method for nonsmooth nonlinear equations (Q344250) (← links)
• A nonmonotone line search slackness technique for unconstrained optimization (Q378287) (← links)
• A non-monotone line search algorithm for unconstrained optimization (Q618548) (← links)
• A smoothing Newton method with a mixed line search for monotone weighted complementarity problems (Q782310) (← links)
• A derivative-free nonmonotone line-search technique for unconstrained optimization (Q935796) (← links)
• An extended nonmonotone line search technique for large-scale unconstrained optimization (Q1675990) (← links)
• On the nonmonotonicity degree of nonmonotone line searches (Q1697277) (← links)
• A new smoothing method for mathematical programs with complementarity constraints based on logarithm-exponential function (Q1721022) (← links)
• Global convergence of a descent PRP type conjugate gradient method for nonconvex optimization (Q2073942) (← links)
• Global convergence of a nonmonotone Broyden family method for nonconvex unconstrained minimization (Q2167421) (← links)
• An integrated bi-objective optimization model and improved genetic algorithm for vehicle routing problems with temporal and spatial constraints (Q2190260) (← links)
• Optimal pricing and ordering in global supply chain management with constraints under random demand (Q2281766) (← 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)
• New five-step DTZD algorithm for future nonlinear minimization with quartic steady-state error pattern (Q2424037) (← links)
• A nonmonotone approximate sequence algorithm for unconstrained nonlinear optimization (Q2436686) (← links)
• An inexact line search approach using modified nonmonotone strategy for unconstrained optimization (Q2453471) (← links)
• An unconstrained optimization method using nonmonotone second order Goldstein's line search (Q2464310) (← links)
• A nonmonotone smoothing Newton method for circular cone programming (Q2836100) (← links)
• General form of nonmonotone line search techniques for unconstrained optimization (Q2867363) (← links)
• Investigation on a nonmonotone cautious BFGS algorithm (Q2886674) (← links)
• A class of nonmonotone Armijo-type line search method for unconstrained optimization (Q2903129) (← links)
• (Q3014265) (← links)
• (Q3014469) (← links)
• A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem (Q4979781) (← links)
• (Q5096719) (← links)
• The higher-order Levenberg–Marquardt method with Armijo type line search for nonlinear equations (Q5268935) (← links)
• An adaptive nonmonotone global Barzilai–Borwein gradient method for unconstrained optimization (Q5277958) (← links)
• OPTIMAL DECISION MAKING FOR ONLINE AND OFFLINE RETAILERS UNDER BOPS MODE (Q5369469) (← links)
• A new nonmonotone line search technique for unconstrained optimization (Q5900212) (← 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)
• Two modified adaptive cubic regularization algorithms by using the nonmonotone Armijo-type line search (Q6062861) (← links)
• A regularized limited memory subspace minimization conjugate gradient method for unconstrained optimization (Q6141538) (← links)
• An inexact nonmonotone projected gradient method for constrained multiobjective optimization (Q6561493) (← links)
• A scalar Hessian estimation with a sparse nonmonotone line search technique for the sparse recovery problem (Q6574066) (← links)