A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
From MaRDI portal
Publication:4651982
DOI10.1137/S1052623403428208zbMATH Open1073.90024OpenAlexW2167137033MaRDI QIDQ4651982FDOQ4651982
Authors: Hongchao Zhang, William Hager 
Publication date: 23 February 2005
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623403428208
Recommendations
- A non-monotone line search algorithm for unconstrained optimization
- A new nonmonotone line search technique for unconstrained optimization
- A new nonmonotone line search technique for unconstrained optimization
- On the nonmonotone line search
- A nonmonotone line search method and its convergence for unconstrained optimization
Complexity and performance of numerical algorithms (65Y20) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26)
Cited In (only showing first 100 items - show all)
- A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints
- An effective first order reliability method based on Barzilai-Borwein step
- First-order methods for the convex hull membership problem
- Structured spectral algorithm with a nonmonotone line search for nonlinear least squares
- Structured diagonal Gauss-Newton method for nonlinear least squares
- Projected nonmonotone search methods for optimization with orthogonality constraints
- A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimization
- A nonmonotone smoothing Newton algorithm for weighted complementarity problem
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
- On the rate of convergence of projected Barzilai-Borwein methods
- On the convergence rate of scaled gradient projection method
- Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming
- A regularized limited memory subspace minimization conjugate gradient method for unconstrained optimization
- A cubic regularization of Newton's method with finite difference Hessian approximations
- An FE-inexact heterogeneous ADMM for elliptic optimal control problems with \(L^1\)-control cost
- A Barzilai-Borwein descent method for multiobjective optimization problems
- Multiscale nonrigid point cloud registration using rotation-invariant sliced-Wasserstein distance via Laplace-Beltrami eigenmap
- Nonmonotone inexact restoration approach for minimization with orthogonality constraints
- A brief introduction to manifold optimization
- A generalized worst-case complexity analysis for non-monotone line searches
- Randomized algorithms for high quality treatment planning in volumetric modulated arc therapy
- A structured quasi-Newton algorithm with nonmonotone search strategy for structured NLS problems and its application in robotic motion control
- A nonmonotone trust region method for unconstrained optimization problems on Riemannian manifolds
- A new simple model trust-region method with generalized Barzilai-Borwein parameter for large-scale optimization
- Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm
- Effective algorithms for solving trace minimization problem in multivariate statistics
- An adaptive Riemannian gradient method without function evaluations
- New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization
- Spectral residual method for nonlinear equations on Riemannian manifolds
- Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems
- A nonmonotone ODE-based method for unconstrained optimization
- A subspace minimization conjugate gradient method based on conic model for unconstrained optimization
- Worst-case evaluation complexity of derivative-free nonmonotone line search methods for solving nonlinear systems of equations
- Non-interior-point smoothing Newton method for CP revisited and its application to support vector machines
- A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization
- A proximal gradient method for ensemble density functional theory
- An application-based characterization of dynamical distance geometry problems
- An alternate gradient method for optimization problems with orthogonality constraints
- Equipping the Barzilai-Borwein method with the two dimensional quadratic termination property
- A nonmonotone smoothing Newton method for system of nonlinear inequalities based on a new smoothing function
- Accelerated augmented Lagrangian method for total variation minimization
- On the inexact scaled gradient projection method
- Structured two-point stepsize gradient methods for nonlinear least squares
- Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems
- Nonmonotone quasi-Newton-based conjugate gradient methods with application to signal processing
- 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
- A projected gradient method for optimization over density matrices
- Extended Dai-Yuan conjugate gradient strategy for large-scale unconstrained optimization with applications to compressive sensing
- Nonmonotone diagonally scaled limited-memory BFGS methods with application to compressive sensing based on a penalty model
- A non-monotone linear search algorithm with mixed direction on Stiefel manifold
- Non-monotone inexact restoration method for nonlinear programming
- A nonmonotone scaled Fletcher-Reeves conjugate gradient method with application in image reconstruction
- A first order reliability method based on hybrid conjugate approach with adaptive Barzilai-Borwein steps
- A derivative-free PRP method for solving large-scale nonlinear systems of equations and its global convergence
- Gradient methods exploiting spectral properties
- A new cubic convergent method for solving a system of nonlinear equations
- An adaptive trust region method based on simple conic models
- A globally convergent BFGS method with nonmonotone line search for non-convex minimization
- A modified three-term conjugate gradient method with sufficient descent property
- A nonmonotone PSB algorithm for solving unconstrained optimization
- A new restarting adaptive trust-region method for unconstrained optimization
- A hybrid of adjustable trust-region and nonmonotone algorithms for unconstrained optimization
- Smoothing projected cyclic Barzilai–Borwein method for stochastic linear complementarity problems
- An adaptive nonmonotone trust-region method with curvilinear search for minimax problem
- A non-monotone pattern search approach for systems of nonlinear equations
- Nonmonotone conic trust region method with line search technique for bound constrained optimization
- Nonmonotone line search methods with variable sample size
- Non-monotone projection gradient method for non-negative matrix factorization
- A new trust region method for solving least-square transformation of system of equalities and inequalities
- Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem
- A subgradient method with non-monotone line search
- A modified nonmonotone trust region line search method
- An approach based on dwindling filter method for positive definite generalized eigenvalue problem
- An adaptive nonmonotone line search for multiobjective optimization problems
- A nonmonotone line search method and its convergence for unconstrained optimization
- A relaxed nonmonotone adaptive trust region method for solving unconstrained optimization problems
- Title not available (Why is that?)
- Complex-step derivative approximation in noisy environment
- A BFGS trust-region method with a new nonmonotone technique for nonlinear equations
- A new nonmonotone filter Barzilai–Borwein method for solving unconstrained optimization problems
- Folding-free global conformal mapping for genus-0 surfaces by harmonic energy minimization
- A nonmonotone hybrid conjugate gradient method for unconstrained optimization
- A simple sufficient descent method for unconstrained optimization
- Two accelerated nonmonotone adaptive trust region line search methods
- A non-monotone regularization Newton method for the second-order cone complementarity problem
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
- \(L_p\)-norm regularization algorithms for optimization over permutation matrices
- A new derivative-free conjugate gradient method for large-scale nonlinear systems of equations
- A new nonmonotone line-search trust-region approach for nonlinear systems
- Multivariate spectral gradient algorithm for nonsmooth convex optimization problems
- Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing
- Nonmonotone BFGS-trained recurrent neural networks for temporal sequence processing
- Combining nonmonotone conic trust region and line search techniques for unconstrained optimization
- Modified active set projected spectral gradient method for bound constrained optimization
- Spectral projected gradient method for stochastic optimization
- Nonmonotone projected gradient methods based on barrier and Euclidean distances
- A Barzilai-Borwein type method for stochastic linear complementarity problems
- A nonmonotone filter line search technique for the MBFGS method in unconstrained optimization
- A brief survey of methods for solving nonlinear least-squares problems
Uses Software
This page was built for publication: A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4651982)
