A Nonmonotone Line Search Technique for Newton’s Method

DOI10.1137/0723046zbMath0616.65067OpenAlexW2043430160MaRDI QIDQ4725638

Stefano Lucidi, Luigi Grippo, Francesco Lampariello

Publication date: 1986

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0723046

zbMATH Keywords

rate of convergenceglobal convergenceNewton's methodunconstrained minimizationline search techniqueArmijo rulemonotonic decrease

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items

A nonmonotonic hybrid algorithm for min-max problem, A nonmonotone inexact Newton method for unconstrained optimization, A new simple model trust-region method with generalized Barzilai-Borwein parameter for large-scale optimization, Stable equilibrium configuration of two bar truss by an efficient nonmonotone global Barzilai-Borwein gradient method in a fuzzy environment, A pathsearch damped Newton method for computing general equilibria, A memory gradient method based on the nonmonotone technique, Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints, Parallel variable distribution algorithm for constrained optimization with nonmonotone technique, A new approach to improve ill-conditioned parabolic optimal control problem via time domain decomposition, Global convergence of a new nonmonotone filter method for equality constrained optimization, Two globally convergent nonmonotone trust-region methods for unconstrained optimization, A new version of the Liu-Storey conjugate gradient method, An efficient augmented Lagrangian method with applications to total variation minimization, Semismooth Newton method for frictional contact between pseudo-rigid bodies, A Newton's method for perturbed second-order cone programs, Nonmonotone derivative-free methods for nonlinear equations, Numerical research on the sensitivity of nonmonotone trust region algorithms to their parameters, The global convergence of self-scaling BFGS algorithm with non-monotone line search for unconstrained nonconvex optimization problems, Global convergence and the Powell singular function, A new nonmonotone trust-region method of conic model for solving unconstrained optimization, Trace-penalty minimization for large-scale eigenspace computation, An inexact projected LM type algorithm for solving convex constrained nonlinear equations, A modified nonmonotone BFGS algorithm for unconstrained optimization, Runge-Kutta-like scaling techniques for first-order methods in convex optimization, Complex-step derivative approximation in noisy environment, Hybrid nonmonotone spectral gradient method for the unconstrained minimization problem, An active set Newton-CG method for \(\ell_1\) optimization, Several efficient gradient methods with approximate optimal stepsizes for large scale unconstrained optimization, An adaptive nonmonotone line search for multiobjective optimization problems, A descent Dai-Liao conjugate gradient method for nonlinear equations, A novel hybrid trust region algorithm based on nonmonotone and LOOCV techniques, A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization, The Uzawa-MBB type algorithm for nonsymmetric saddle point problems, Structured two-point stepsize gradient methods for nonlinear least squares, An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization, Gradient method with multiple damping for large-scale unconstrained optimization, On the steplength selection in gradient methods for unconstrained optimization, A modified trust region method with beale's PCG technique for optimization, A nonmonotone trust-region line search method for large-scale unconstrained optimization, Shape optimization for tumor location, A new non-monotone self-adaptive trust region method for unconstrained optimization, A non-monotone line search multidimensional filter-SQP method for general nonlinear programming, A subgradient method with non-monotone line search, A nonmonotone approximate sequence algorithm for unconstrained nonlinear optimization, A harmonic framework for stepsize selection in gradient methods, A nonmonotone line search filter method with reduced Hessian updating for nonlinear optimization, An adaptive nonmonotone trust-region method with curvilinear search for minimax problem, An inexact line search approach using modified nonmonotone strategy for unconstrained optimization, An unconstrained optimization method using nonmonotone second order Goldstein's line search, An improved gradient projection-based decomposition technique for support vector machines, An affine scaling interior algorithm via Lanczos path for solving bound-constrained nonlinear systems, A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function values, Nonmonotone projected gradient methods based on barrier and Euclidean distances, A descent method for a reformulation of the second-order cone complementarity problem, Incorporating nonmonotone strategies into the trust region method for unconstrained optimization, Parameter optimization using the \(L_\infty \) exact penalty function and strictly convex quadratic programming problems, An affine scaling projective reduced Hessian algorithm for minimum optimization with nonlinear equality and linear inequality constraints, Secant algorithms with nonmonotone trust region that employs fletcher penalty function for constrained optimization, On the asymptotic behaviour of some new gradient methods, Convergence property of gradient-type methods with non-monotone line search in the presence of perturbations, An affine scaling interior trust-region method for \(LC^{1}\) minimization subject to bounds on variables, New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds, Convergence of nonmonotone line search method, A combined global \& local search (CGLS) approach to global optimization, A nonmonotone Broyden method for unconstrained optimization, Dogleg paths and trust region methods with back tracking technique for unconstrained optimization, Interior point projected reduced Hessian method with trust region strategy for nonlinear constrained optimization, A new nonmonotone adaptive trust region method based on simple quadratic models, An ODE-based nonmonotone method for unconstrained optimization problems, Barzilai-Borwein-like methods for the extreme eigenvalue problem, A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations, A new nonmonotone filter Barzilai–Borwein method for solving unconstrained optimization problems, Solving unconstrained optimization problem with a filter-based nonmonotone pattern search algorithm, A family of derivative-free conjugate gradient methods for large-scale nonlinear systems of equations, A new family of conjugate gradient methods, A smoothing-type algorithm for the second-order cone complementarity problem with a new nonmonotone line search, A one-parametric class of smoothing functions and an improved regularization Newton method for the NCP, An efficient optimization approach for a cardinality-constrained index tracking problem, A projected gradient method for optimization over density matrices, Projection onto a Polyhedron that Exploits Sparsity, A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques, An improved nonmonotone adaptive trust region method., A nonmonotone line search method and its convergence for unconstrained optimization, A nonmonotone smoothing Newton method for system of nonlinear inequalities based on a new smoothing function, A family of spectral gradient methods for optimization, Alternating direction and Taylor expansion minimization algorithms for unconstrained nuclear norm optimization, An affine scaling trust-region algorithm with interior backtracking technique for solving bound-constrained nonlinear systems, Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems, Planar conjugate gradient algorithm for large-scale unconstrained optimization. II: Application, Spectral gradient methods for linearly constrained optimization, An effective trust-region-based approach for symmetric nonlinear systems, A Modified Hestenes-Stiefel Conjugate Gradient Algorithm for Large-Scale Optimization, Improved filter-SQP algorithm with active set for constrained minimax problems, Affine scaling inexact generalized Newton algorithm with interior backtracking technique for solving bound-constrained semismooth equations, Nonmonotone line search methods with variable sample size, A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization, A nonmonotone hybrid conjugate gradient method for unconstrained optimization, An efficient monotone projected Barzilai-Borwein method for nonnegative matrix factorization, A relaxed nonmonotone adaptive trust region method for solving unconstrained optimization problems, Convergence analysis for the modified spectral projected subgradient method, An improvement of adaptive cubic regularization method for unconstrained optimization problems, An efficient nonmonotone projected Barzilai–Borwein method for nonnegative matrix factorization with extrapolation, A non-monotone pattern search approach for systems of nonlinear equations, A derivative-free affine scaling trust region methods based on probabilistic models with new nonmonotone line search technique for linear inequality constrained minimization without strict complementarity, An adaptive nonmonotone global Barzilai–Borwein gradient method for unconstrained optimization, Inexact variable metric method for convex-constrained optimization problems, Finding zeros of Hölder metrically subregular mappings via globally convergent Levenberg–Marquardt methods, A reconstruction algorithm for electrical impedance tomography based on sparsity regularization, Convergence properties of inexact projected gradient methods, A nonmonotone gradient method for constrained multiobjective optimization problems, A class of nonmonotone Armijo-type line search method for unconstrained optimization, A non-monotone trust region algorithm for unconstrained optimization with dynamic reference iteration updates using filter, A new cubic convergent method for solving a system of nonlinear equations, A Globally Convergent Trust-Region Method for Large-Scale Symmetric Nonlinear Systems, Non Monotone Backtracking Inexact BFGS Method for Regression Analysis, Data-driven distributionally robust risk parity portfolio optimization, On the rate of convergence of projected Barzilai–Borwein methods, A Positive Barzilai–Borwein-Like Stepsize and an Extension for Symmetric Linear Systems, A modified quasi‐Newton diagonal update algorithm for total variation denoising problems and nonlinear monotone equations with applications in compressive sensing, An affine scaling interior point backtracking algorithm for nonlinear constrained optimisation, On the convergence rate of scaled gradient projection method, A new nonmonotone trust region method for unconstrained optimization equipped by an efficient adaptive radius, Projected gradient algorithms for optimization over order simplices, Gradient projection methods for quadratic programs and applications in training support vector machines, A Modified Non-Monotone BFGS Method for Non-Convex Unconstrained Optimization, A nonmonotone ODE-based method for unconstrained optimization, A New Augmented Lagrangian Method for MPCCs—Theoretical and Numerical Comparison with Existing Augmented Lagrangian Methods, Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems, Using Krylov subspace and spectral methods for solving complementarity problems in many-body contact dynamics simulation, A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming, Spectral Properties of Barzilai--Borwein Rules in Solving Singly Linearly Constrained Optimization Problems Subject to Lower and Upper Bounds, Total Variation Based Community Detection Using a Nonlinear Optimization Approach, A Trust Region Algorithm with Memory for Equality Constrained Optimization, Gradient-based method with active set strategy for $\ell _1$ optimization, Shearlet-based regularized reconstruction in region-of-interest computed tomography, Inexact Newton-type methods based on Lanczos orthonormal method and application for full waveform inversion, An adaptive nonmonotone trust region algorithm, Gradient methods exploiting spectral properties, On the global convergence of a nonmonotone proximal bundle method for convex nonsmooth minimization, Global convergece of the bfgs algorithm with nonmonotone linesearch^∗∗this work is supported by national natural science foundation$ef:, Nonmonotone Self-adaptive Levenberg–Marquardt Approach for Solving Systems of Nonlinear Equations, Inexact primal–dual gradient projection methods for nonlinear optimization on convex set, On the generalized Fischer-Burmeister merit function for the second-order cone complementarity problem, A NONMONOTONE FILTER BARZILAI-BORWEIN METHOD FOR OPTIMIZATION, An efficient Levenberg–Marquardt method with a new LM parameter for systems of nonlinear equations, CONVERGENCE PROPERTY AND MODIFICATIONS OF A MEMORY GRADIENT METHOD, Solving nonlinear systems of equations by means of quasi-neston methods with a nonmonotone stratgy^∗, A nonmonotone inexact Newton method, The Sequential Quadratic Programming Method, Nonmonotone Spectral Methods for Large-Scale Nonlinear Systems, A anonmonotone line search technique for improved projected quasi-newton methods^*this research was supported in party by the national natural science foundation of china$ef:, On a semismooth least squares formulation of complementarity problems with gap reduction, Inexact semismooth Newton methods for large-scale complementarity problems, An alternating direction method for linear‐constrained matrix nuclear norm minimization, Smoothing projected cyclic Barzilai–Borwein method for stochastic linear complementarity problems, Properties of a class of multilevel optimization algorithms for equality-constrained problems, Inexact quasi-Newton global convergent method for solving constrained nonsmooth equations, Some new step-size rules for optimization problems, Global and local convergence of a filter line search method for nonlinear programming, A nonmonotone semismooth inexact Newton method, The non-monotone conic algorithm, Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems, A Simulated Annealing-Based Barzilai–Borwein Gradient Method for Unconstrained Optimization Problems, Cost approximation algorithms with nonmonotone line searches for a general class of nonlinear programs, Unnamed Item, A nonmonotone SQP-filter method for equality constrained optimization, Practical implementation of an interior point nonmonotone line search filter method, Global convergence of conjugate gradient method, A hybrid Josephy — Newton method for solving box constrained variational equality roblems via the D-gap function, An Infeasible Interior-Point Method with Nonmonotonic Complementarity Gaps, Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization, Spectral residual method without gradient information for solving large-scale nonlinear systems of equations, A globalization strategy for the multigrid solution of elliptic optimal control problems, Globally and superlinearly convergent inexact Newton-Krylov algorithms for solving nonsmooth equations, A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem, On the Local Convergence of a Penalty-Function-Free SQP Method, An efficient adaptive trust-region method for systems of nonlinear equations, Alternate step gradient method*, COMBINATION ADAPTIVE TRUST REGION METHOD BY NON-MONOTONE STRATEGY FOR UNCONSTRAINED NONLINEAR PROGRAMMING, Nonmonotone Learning of Recurrent Neural Networks in Symbolic Sequence Processing Applications, Assessing the potential of interior point barrier filter line search methods: nonmonotoneversusmonotone approach, A modified Newton direction for unconstrained optimization, Nonmonotone conic trust region method with line search technique for bound constrained optimization, On the Solution of ℓ₀-Constrained Sparse Inverse Covariance Estimation Problems, A BFGS trust-region method with a new nonmonotone technique for nonlinear equations, Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization, AN IMPROVED ADAPTIVE TRUST-REGION METHOD FOR UNCONSTRAINED OPTIMIZATION, Equipping the Barzilai--Borwein Method with the Two Dimensional Quadratic Termination Property, A nonmonotone hybrid method for nonlinear systems^∗, Unnamed Item, A modified two-point stepsize gradient algorithm for unconstrained minimization, On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization, A variant of curved search method, Extended Dai-Yuan conjugate gradient strategy for large-scale unconstrained optimization with applications to compressive sensing, The higher-order Levenberg–Marquardt method with Armijo type line search for nonlinear equations, Optimal control of viscous Burgers equation via an adaptive nonmonotone Barzilai–Borwein gradient method, A nonmonotone scaled conjugate gradient algorithm for large-scale unconstrained optimization, An affine scaling interior trust-region method combining with nonmonotone line search filter technique for linear inequality constrained minimization, Combining line search and trust-region methods forℓ1-minimization, Correction of trust region method with a new modified Newton method, Global convergence of the Broyden's class of quasi-Newton methods with nonmonotone linesearch, A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations, A new nonmonotone adaptive trust region algorithm., Nonmonotone trust region method for solving optimization problems, A two-piece update of projected Hessian algorithm with nonmonotonic trust region method for constrained optimization, A cubic regularization of Newton's method with finite difference Hessian approximations, A truncated Newton algorithm for nonconvex sparse recovery, LMBOPT: a limited memory method for bound-constrained optimization, Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming, A Newton-type method for positive-semidefinite linear complementarity problems, A global convergent semi-smooth Newton method for semi-linear elliptic optimal control problem, Nonmonotone diagonally scaled limited-memory BFGS methods with application to compressive sensing based on a penalty model, Global convergence of a nonmonotone Broyden family method for nonconvex unconstrained minimization, Nonmonotone spectral gradient method based on memoryless symmetric rank-one update for large-scale unconstrained optimization, Penalized NCP-functions for nonlinear complementarity problems and a scaling algorithm, FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming, A Dai-Liao conjugate gradient method via modified secant equation for system of nonlinear equations, A new modified nonmonotone adaptive trust region method for unconstrained optimization, A class of accelerated conjugate-gradient-like methods based on a modified secant equation, Nonmonotone spectral method for large-scale symmetric nonlinear equations, Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming, Monotone and nonmonotone trust-region-based algorithms for large scale unconstrained optimization problems, A Shamanskii-like self-adaptive Levenberg-Marquardt method for nonlinear equations, An improved nonmonotone filter trust region method for equality constrained optimization, A Gauss-Newton approach for solving constrained optimization problems using differentiable exact penalties, Descent Perry conjugate gradient methods for systems of monotone nonlinear equations, A nonmonotone line search filter algorithm for the system of nonlinear equations, A derivative-free Liu-Storey method for solving large-scale nonlinear systems of equations, Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case, An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints, A survey of gradient methods for solving nonlinear optimization, Efficient algorithms for solving condition number-constrained matrix minimization problems, A Riemannian nonmonotone spectral method for self-adjoint tangent vector field, A hybrid method for solving systems of nonsmooth equations with box constraints, A new nonmonotone adaptive trust region line search method for unconstrained optimization, Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch, A modified ODE-based algorithm for unconstrained optimization problems, The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints, A family of new smoothing functions and~a~nonmonotone smoothing Newton method for the nonlinear complementarity problems, A nonmonotone trust region method based on simple quadratic models, A new spectral method for \(l_1\)-regularized minimization, A new nonmonotone line-search trust-region approach for nonlinear systems, Low-rank and sparse matrices fitting algorithm for low-rank representation, Nonmonotone adaptive trust region method based on simple conic model for unconstrained optimization, A reduced-space line-search method for unconstrained optimization via random descent directions, Two--parameter scaled memoryless BFGS methods with a nonmonotone choice for the initial step length, Steplength selection in gradient projection methods for box-constrained quadratic programs, Nonmonotone adaptive trust region method with line search based on new diagonal updating, A nonmonotone PRP conjugate gradient method for solving square and under-determined systems of equations, A semismooth Newton method for SOCCPs based on a one-parametric class of SOC complementarity functions, A new trust region method for solving least-square transformation of system of equalities and inequalities, Spectral gradient projection method for monotone nonlinear equations with convex constraints, A derivative-free method for solving box-constrained underdetermined nonlinear systems of equations, Nonmonotone line searches for unconstrained multiobjective optimization problems, A new nonmonotone trust region Barzilai-Borwein method for unconstrained optimization problems, A class on nonmonotone stabilization methods in unconstrained optimization, Improved conjugate gradient method for nonlinear system of equations, A generalized worst-case complexity analysis for non-monotone line searches, A family of Hager-Zhang conjugate gradient methods for system of monotone nonlinear equations, A nonmonotone trust region method for unconstrained optimization problems on Riemannian manifolds, Planar methods and grossone for the conjugate gradient breakdown in nonlinear programming, ACQUIRE: an inexact iteratively reweighted norm approach for TV-based Poisson image restoration, On efficiency of nonmonotone Armijo-type line searches, A new regularized quasi-Newton method for unconstrained optimization, Dynamic search trajectory methods for global optimization, A global Newton method for the nonsmooth vector fields on Riemannian manifolds, An inexact affine scaling Levenberg-Marquardt method under local error bound conditions, A global hybrid derivative-free method for high-dimensional systems of nonlinear equations, A unified convergence framework for nonmonotone inexact decomposition methods, A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs, A residual-based algorithm for solving a class of structured nonsmooth optimization problems, Spectral residual method for nonlinear equations on Riemannian manifolds, Worst-case evaluation complexity of derivative-free nonmonotone line search methods for solving nonlinear systems of equations, Two nonmonotone trust region algorithms based on an improved Newton method, Nonmonotonic back-tracking trust region interior point algorithm for linear constrained optimization, Nonmonotone line search algorithm for constrained minimax problems, On finite termination of an iterative method for linear complementarity problems, Gauss-Newton methods with approximate projections for solving constrained nonlinear least squares problems, An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization, Nonmonotone curvilinear line search methods for unconstrained optimization, Enhanced Dai-Liao conjugate gradient methods for systems of monotone nonlinear equations, Two descent Dai-Yuan conjugate gradient methods for systems of monotone nonlinear equations, On large-scale unconstrained optimization and arbitrary regularization, On the inexact scaled gradient projection method, A nonmonotone adaptive trust region method and its convergence, Minimization over the \(\ell_1\)-ball using an active-set non-monotone projected gradient, Diagonally scaled memoryless quasi-Newton methods with application to compressed sensing, Global convergence of Riemannian line search methods with a Zhang-Hager-type condition, On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches, Regularized graph cuts based discrete tomography reconstruction methods, A nonmonotone scaled Fletcher-Reeves conjugate gradient method with application in image reconstruction, Convergence properties of monotone and nonmonotone proximal gradient methods revisited, A class of line search-type methods for nonsmooth convex regularized minimization, First-order methods for the convex hull membership problem, Adaptive three-term family of conjugate residual methods for system of monotone nonlinear equations, Hybrid limited memory gradient projection methods for box-constrained optimization problems, Avoiding bad steps in Frank-Wolfe variants, Linear convergence of a nonmonotone projected gradient method for multiobjective optimization, Nonmonotone trust region algorithm for solving the unconstrained multiobjective optimization problems, Structured diagonal Gauss-Newton method for nonlinear least squares, Nonmonotone stabilization methods for nonlinear equations, A class of nonmonotone stabilization trust region methods, A hybrid of adjustable trust-region and nonmonotone algorithms for unconstrained optimization, A new adaptive trust-region method for system of nonlinear equations, Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules, An \(R\)-linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer-Burmeister merit function, A truncated Newton method with non-monotone line search for unconstrained optimization, A nonmonotone smoothing-type algorithm for solving a system of equalities and inequalities, Comparison of minimization methods for nonsmooth image segmentation, Partial spectral projected gradient method with active-set strategy for linearly constrained optimization, New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems, A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems, Nonmonotone trust-region method for nonlinear programming with general constraints and simple bounds, Gradient methods with adaptive step-sizes, Random tunneling by means of acceptance-rejection sampling for global optimization, Two accelerated nonmonotone adaptive trust region line search methods, Testing the topographical global initialization strategy in the framework of an unconstrained optimization method, A new adaptive Barzilai and Borwein method for unconstrained optimization, Modified spectral projected subgradient method: convergence analysis and momentum parameter heuristics, Monotone projected gradient methods for large-scale box-constrained quadratic programming, Nonmonotone Levenberg-Marquardt algorithms and their convergence analysis, Strong global convergence of an adaptive nonmonotone memory gradient method, Spectral projected subgradient with a momentum term for the Lagrangean dual approach, An affine scaling reduced preconditional conjugate gradient path method for linear constrained optimization, A new class of nonmonotone adaptive trust-region methods for nonlinear equations with box constraints, An extended nonmonotone line search technique for large-scale unconstrained optimization, Nonmonotone smoothing Broyden-like method for generalized nonlinear complementarity problems, On the convergence of a new hybrid projection algorithm, Real-time motion planning for multibody systems, Nonsmooth spectral gradient methods for unconstrained optimization, A new restarting adaptive trust-region method for unconstrained optimization, A spectral algorithm for large-scale systems of nonlinear monotone equations, An adaptive trust region method based on simple conic models, A new nonmonotone adaptive retrospective trust region method for unconstrained optimization problems, A nonmonotone adaptive trust region method based on conic model for unconstrained optimization, A new steplength selection for scaled gradient methods with application to image deblurring, On the worst-case evaluation complexity of non-monotone line search algorithms, Nonmonotone gradient methods for vector optimization with a portfolio optimization application, On the nonmonotonicity degree of nonmonotone line searches, Global convergence of algorithms with nonmonotone line search strategy in unconstrained optimization, A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization, A new affine scaling interior point algorithm for nonlinear optimization subject to linear equality and inequality constraints., The convergence of equilibrium algorithms with non-monotone line search technique., A structured diagonal Hessian approximation method with evaluation complexity analysis for nonlinear least squares, Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming, A nonmonotone weighting self-adaptive trust region algorithm for unconstrained nonconvex optimization, Combining trust region and linesearch algorithm for equality constrained optimization, A numerical study of applying spectral-step subgradient method for solving nonsmooth unconstrained optimization problems, A note on robust descent in differentiable optimization, Efficient projected gradient methods for cardinality constrained optimization, A non-monotone regularization Newton method for the second-order cone complementarity problem, Affine scaling interior Levenberg-Marquardt method for bound-constrained semismooth equations under local error bound conditions, A derivative-free nonmonotone line-search technique for unconstrained optimization, A nonmonotone trust-region method of conic model for unconstrained optimization, The global and superlinear convergence of a new nonmonotone MBFGS algorithm on convex objective functions, A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function, Solving bound constrained optimization via a new nonmonotone spectral projected gradient method, Multivariate spectral gradient method for unconstrained optimization, Smoothing Newton method for minimizing the sum of \(p\) -norms, On a scalable nonparametric denoising of time series signals, Nonmonotone trust region methods with curvilinear path in unconstrained optimization, Globalizing a nonsmooth Newton method via nonmonotone path search, Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization, A nonmonotone filter trust region method for nonlinear constrained optimization, An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization, Superlinearly convergent affine scaling interior trust-region method for linear constrained \(LC^{1}\) minimization, Numerical comparisons of two effective methods for mixed complementarity problems, A one-parametric class of merit functions for the second-order cone complementarity problem, Nonmonotone backtracking inexact quasi-Newton algorithms for solving smooth nonlinear equations, A PRP type method for systems of monotone equations, Global and local convergence of a nonmonotone trust region algorithm for equality constrained optimization, A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization, A trust region algorithm via bilevel linear programming for solving the general multicommodity minimal cost flow problems, Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems, Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming, Nonmonotone adaptive trust-region method for unconstrained optimization problems, Notes on the Dai-Yuan-Yuan modified spectral gradient method, Wing aerodynamic optimization using efficient mathematically-extracted modal design variables, A family of NCP functions and a descent method for the nonlinear complementarity problem, A nonmonotone conic trust region method based on line search for solving unconstrained optimization, An affine scaling optimal path method with interior backtracking curvilinear technique for linear constrained optimization, Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization, Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems, A globally convergent BFGS method with nonmonotone line search for non-convex minimization, A modified PRP conjugate gradient method, A modified SQP method with nonmonotone technique and its global convergence, Nonmonotonic projected algorithm with both trust region and line search for constrained optimization, Nonmonotonic reduced projected Hessian method via an affine scaling interior modified gradient path for bounded-constrained optimization, Global convergence of nonmonotone strategies in parallel methods for block-bordered nonlinear systems, A class of nonmonotone trust region algorithms for unconstrained optimization problems, A mixed superlinearly convergent algorithm with nonmonotone search for constrained optimizations, Theoretical and numerical investigation of the D-gap function for box constrained variational inequalities, A class of nonmonotone conjugate gradient methods for unconstrained optimization, Solving box constrained variational inequalities by using the natural residual with D-gap function globalization, A continuously differentiable exact penalty function for nonlinear programming problems with unbounded feasible set, Nonmonotone bundle-type scheme for convex nonsmooth minimization, Nonmonotonic trust region algorithm, Nonmonotone line search for minimax problems, Gauss-Newton methods for the complementarity problem, Continuation method for nonlinear complementarity problems via normal maps, On the application of the spectral projected gradient method in image segmentation, A new active-set strategy for NCP with degenerate solutions, A nonmonotone trust region method based on simple conic models for unconstrained optimization, A nonmonotone spectral projected gradient method for tensor eigenvalue complementarity problems, Globalizing stabilized sequential quadratic programming method by smooth primal-dual exact penalty function, A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem, A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems, A line search trust-region algorithm with nonmonotone adaptive radius for a system of nonlinear equations, A Polak-Ribière-Polyak method for solving large-scale nonlinear systems of equations and its global convergence, On Newton's method for the Fermat-Weber location problem, Projection algorithms for nonconvex minimization with application to sparse principal component analysis, An active set truncated Newton method for large-scale bound constrained optimization, An ODE-like nonmonotone method for nonsmooth convex optimization, A nonmonotone GRASP, A Barzilai-Borwein conjugate gradient method, Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem, Computationally efficient approach for the minimization of volume constrained vector-valued Ginzburg-Landau energy functional, Modified subspace Barzilai-Borwein gradient method for non-negative matrix factorization, Use of the minimum norm search direction in a nonmonotone version of the Gauss-Newton method, A two-parametric class of merit functions for the second-order cone complementarity problem, Scaling on the spectral gradient method, A nonmonotone trust region method with new inexact line search for unconstrained optimization, Scaled diagonal gradient-type method with extra update for large-scale unconstrained optimization, Nonlinear conjugate gradient methods with Wolfe type line search, A nonmonotone line search slackness technique for unconstrained optimization, The convergence of conjugate gradient method with nonmonotone line search, A nonmonotone trust region method with adaptive radius for unconstrained optimization problems, A simple sufficient descent method for unconstrained optimization, A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization, Inexact Newton method via Lanczos decomposed technique for solving box-constrained nonlinear systems, A nonmonotone adaptive trust region method for unconstrained optimization based on conic model, Nonmonotone trust region algorithm for unconstrained optimization problems, A non-monotone line search algorithm for unconstrained optimization, Nonmonotone algorithm for minimization on closed sets with applications to minimization on Stiefel manifolds, Nonmonotone second-order Wolfe's line search method for unconstrained optimization problems, An efficient nonmonotone trust-region method for unconstrained optimization, A filter secant method with nonmonotone line search for equality constrained optimization, Nonmonotone BFGS-trained recurrent neural networks for temporal sequence processing, A multivariate spectral projected gradient method for bound constrained optimization, Combining nonmonotone conic trust region and line search techniques for unconstrained optimization, Nonmonotone algorithm for minimax optimization problems, Non-monotone projection gradient method for non-negative matrix factorization, Implementation of an optimal first-order method for strongly convex total variation regularization, Modified active set projected spectral gradient method for bound constrained optimization, Global convergence of a nonmonotone filter method for equality constrained optimization, A new class of penalized NCP-functions and its properties, A new analysis on the Barzilai-Borwein gradient method, A nonmonotone derivative-free algorithm for nonlinear complementarity problems based on the new generalized penalized Fischer-Burmeister merit function, Scalar correction method for solving large scale unconstrained minimization problems, Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing, A nonmonotone line search based algorithm for distribution center location selected, Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search, Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization, An efficient gradient method using the Yuan steplength, Global convergence of a nonmonotone trust region algorithm with memory for unconstrained optimization, A nonmonotone filter line search technique for the MBFGS method in unconstrained optimization, A nonmonotone hybrid method of conjugate gradient and Lanczos-type for solving nonlinear systems, Analysis of a non-monotone smoothing-type algorithm for the second-order cone programming., A new generalized shrinkage conjugate gradient method for sparse recovery, Spectral residual methods with two new non-monotone line searches for large-scale nonlinear systems of equations, A new class of nonmonotone conjugate gradient training algorithms, A feasible filter method for the nearest low-rank correlation matrix problem, A Barzilai-Borwein type method for minimizing composite functions, Spectral projected gradient method for stochastic optimization, New implementations of the 2-factor method, Spectral gradient method for impulse noise removal, A nonmonotone line search method for noisy minimization, A trust-region approach with novel filter adaptive radius for system of nonlinear equations, A class of diagonal quasi-Newton methods for large-scale convex minimization, A quasi-Newton algorithm for large-scale nonlinear equations, An accelerated nonmonotone trust region method with adaptive trust region for unconstrained optimization, An inexact restoration derivative-free filter method for nonlinear programming, An inexact proximal regularization method for unconstrained optimization, A nonmonotone Jacobian smoothing inexact Newton method for NCP, An inexact secant algorithm for large scale nonlinear systems of equalities and inequalities, A Kronecker approximation with a convex constrained optimization method for blind image restoration, A filter trust-region algorithm for unconstrained optimization with strong global convergence properties, A nonmonotone PSB algorithm for solving unconstrained optimization, Modified nonmonotone Armijo line search for descent method, Convex constrained optimization for large-scale generalized Sylvester equations, A robust implementation of a sequential quadratic programming algorithm with successive error restoration, Global convergence of nonmonotone descent methods for unconstrained optimization problems, A class of nonmonotone conjugate gradient methods for nonconvex functions, A kind of nonmonotone filter method for nonlinear complementarity problem, Large correlation analysis, Nonmonotone filter DQMM method for the system of nonlinear equations, A new hybrid method for nonlinear complementarity problems, An interior affine scaling projective algorithm for nonlinear equality and linear inequality constrained optimization, Convergence properties of nonmonotone spectral projected gradient methods, A limited memory steepest descent method, Projected Hessian algorithm with backtracking interior point technique for linear constrained optimization, A modified nonmonotone trust region line search method, A nonmonotonic trust region algorithm for a class of semi-infinite minimax programming, A nonmonotone supermemory gradient algorithm for unconstrained optimization, An affine scaling method for optimization problems with polyhedral constraints, Sequential importance sampling of binary sequences, A framework of constraint preserving update schemes for optimization on Stiefel manifold, Impulse noise removal by an adaptive trust-region method, Nomonotone spectral gradient method for sparse recovery, Convergence of descent method with new line search, Unnamed Item, An augmented Lagrangian method for optimization problems with structured geometric constraints, Variable metric method for unconstrained multiobjective optimization problems, Augmented Lagrangian cone method for multiobjective optimization problems with an application to an optimal control problem, A new nonmonotone spectral projected gradient algorithm for box-constrained optimization problems in \(m \times n\) real matrix space with application in image clustering, Adaptive nonmonotone line search method for unconstrained optimization, Two modified adaptive cubic regularization algorithms by using the nonmonotone Armijo-type line search, Nonmonotone feasible arc search algorithm for minimization on Stiefel manifold, Nonmonotone quasi-Newton-based conjugate gradient methods with application to signal processing, A gradient method exploiting the two dimensional quadratic termination property, Regularized Newton Method with Global \({\boldsymbol{\mathcal{O}(1/{k}^2)}}\) Convergence, Conditional gradient method for vector optimization, Solving nonlinear equations with a direct Broyden method and its acceleration, A hybrid BB-type method for solving large scale unconstrained optimization, A NONMONOTONE ADMM-BASED DIAGONAL QUASI-NEWTON UPDATE WITH APPLICATION TO THE COMPRESSIVE SENSING PROBLEM, Levenberg-Marquardt revisited and parameter tuning of river regression models, Convergence of a Class of Nonmonotone Descent Methods for Kurdyka–Łojasiewicz Optimization Problems, Proximal quasi-Newton method for composite optimization over the Stiefel manifold, An adaptive Riemannian gradient method without function evaluations, A Barzilai-Borwein descent method for multiobjective optimization problems, Numerical analysis of the model of optimal savings and borrowing, Convergence of derivative-free nonmonotone direct search methods for unconstrained and box-constrained mixed-integer optimization, Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems, A new nonmonotone line search method for nonsmooth nonconvex optimization, An overview of nonlinear optimization, Secant Acceleration of Sequential Residual Methods for Solving Large-Scale Nonlinear Systems of Equations, Unnamed Item, A new nonmonotone line search technique for unconstrained optimization, A new nonmonotone line search technique for unconstrained optimization, A derivative-free PRP method for solving large-scale nonlinear systems of equations and its global convergence, A family of improved secant methods via nonmonotone curvilinear paths technique for equality constrained optimization, Regularized nonsmooth Newton method for multi-class support vector machines, Minimization algorithms based on supervisor and searcher cooperation, Low cost optimization techniques for solving the nonlinear seismic reflection tomography problem, On the nonmonotone line search, An active-set proximal quasi-Newton algorithm for ℓ₁-regularized minimization over a sphere constraint