Pages that link to "Item:Q1095799"

The following pages link to A truncated Newton method with non-monotone line search for unconstrained optimization (Q1095799):

Displaying 50 items.

• A line search trust-region algorithm with nonmonotone adaptive radius for a system of nonlinear equations (Q295877) (← links)
• An active set truncated Newton method for large-scale bound constrained optimization (Q316586) (← links)
• Preconditioning Newton-Krylov methods in nonconvex large scale optimization (Q377728) (← links)
• A nonmonotone line search slackness technique for unconstrained optimization (Q378287) (← links)
• An efficient nonmonotone trust-region method for unconstrained optimization (Q411524) (← links)
• Accelerating the convergence in the single-source and multi-source Weber problems (Q428088) (← links)
• Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search (Q479230) (← links)
• A trust-region approach with novel filter adaptive radius for system of nonlinear equations (Q501965) (← links)
• Modified nonmonotone Armijo line search for descent method (Q535246) (← links)
• A kind of nonmonotone filter method for nonlinear complementarity problem (Q545563) (← links)
• Convergence properties of nonmonotone spectral projected gradient methods (Q557737) (← links)
• A nonmonotone trust region method with adaptive radius for unconstrained optimization problems (Q611316) (← links)
• A non-monotone line search algorithm for unconstrained optimization (Q618548) (← links)
• Partial projected Newton method for a class of stochastic linear complementarity problems (Q652329) (← 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)
• Global convergence of nonmonotone descent methods for unconstrained optimization problems (Q697549) (← links)
• A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization (Q732778) (← links)
• Convergence of descent method with new line search (Q815995) (← links)
• Nonmonotone trust-region method for nonlinear programming with general constraints and simple bounds (Q852152) (← links)
• A truncated nonmonotone Gauss-Newton method for large-scale nonlinear least-squares problems (Q853562) (← links)
• Global convergence of a memory gradient method for unconstrained optimization (Q861515) (← links)
• On the convergence of a new hybrid projection algorithm (Q882531) (← links)
• A new nonmonotone adaptive retrospective trust region method for unconstrained optimization problems (Q896192) (← links)
• Multi-step nonlinear conjugate gradient methods for unconstrained minimization (Q953210) (← 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)
• Nonmonotone trust region methods with curvilinear path in unconstrained optimization (Q1195967) (← links)
• A class of nonmonotone trust region algorithms for unconstrained optimization problems (Q1286707) (← links)
• Nonmonotonic trust region algorithm (Q1321301) (← links)
• A parallel asynchronous Newton algorithm for unconstrained optimization (Q1321336) (← links)
• An unconstrained optimization technique for large-scale linearly constrained convex minimization problems (Q1337633) (← links)
• A class of nonmonotone stabilization trust region methods (Q1337634) (← links)
• Parallel algorithm for unconstrained optimization based on decomposition techniques (Q1379930) (← links)
• A survey of truncated-Newton methods (Q1593812) (← links)
• A hybrid of adjustable trust-region and nonmonotone algorithms for unconstrained optimization (Q1630201) (← links)
• An extended nonmonotone line search technique for large-scale unconstrained optimization (Q1675990) (← links)
• Conjugate direction methods and polarity for quadratic hypersurfaces (Q1695819) (← links)
• On the nonmonotonicity degree of nonmonotone line searches (Q1697277) (← links)
• A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization (Q1704920) (← links)
• MAKHA -- a new hybrid swarm intelligence global optimization algorithm (Q1736664) (← links)
• Nonmonotone adaptive trust-region method for unconstrained optimization problems (Q1774954) (← links)
• Planar methods and grossone for the conjugate gradient breakdown in nonlinear programming (Q1790671) (← links)
• A nonmonotone adaptive trust region method and its convergence (Q1827231) (← links)
• Nonmonotone trust region method for solving optimization problems (Q1886565) (← links)
• Convergence and numerical results for a parallel asynchronous quasi- Newton method (Q1893309) (← links)
• An active set feasible method for large-scale minimization problems with bound constraints (Q1928749) (← links)
• Numerical study of a smoothing algorithm for the complementarity system over the second-order cone (Q1993579) (← links)
• A reduced-space line-search method for unconstrained optimization via random descent directions (Q2007776) (← links)