A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
From MaRDI portal
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
Cited in
(only showing first 100 items - show all)- A regularization method for the second-order cone complementarity problem with the Cartesian \(P_0\)-property
- An affine-scaling interior-point CBB method for box-constrained optimization
- A feasible method for optimization with orthogonality constraints
- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
- A globally convergent BFGS method with nonmonotone line search for non-convex minimization
- Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search
- A truncated Newton method with non-monotone line search for unconstrained optimization
- A hybrid of adjustable trust-region and nonmonotone algorithms for unconstrained optimization
- A new adaptive trust-region method for system of nonlinear equations
- A corrected Levenberg-Marquardt algorithm with a nonmonotone line search for the system of nonlinear equations
- Two accelerated nonmonotone adaptive trust region line search methods
- A new adaptive Barzilai and Borwein method for unconstrained optimization
- A globally convergent method for nonlinear least-squares problems based on the Gauss-Newton model with spectral correction
- Multivariate spectral gradient algorithm for nonsmooth convex optimization problems
- 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
- A new smoothing and regularization Newton method for the symmetric cone complementarity problem
- A new restarting adaptive trust-region method for unconstrained optimization
- 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
- A structured diagonal Hessian approximation method with evaluation complexity analysis for nonlinear least squares
- Quadratic regularization projected Barzilai-Borwein method for nonnegative matrix factorization
- A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization
- A nonmonotone weighting self-adaptive trust region algorithm for unconstrained nonconvex optimization
- Efficient projected gradient methods for cardinality constrained optimization
- Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
- An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization
- A non-monotone regularization Newton method for the second-order cone complementarity problem
- Strong convergence properties of a modified nonmonotone smoothing algorithm for the SCCP
- An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization
- An FE-inexact heterogeneous ADMM for elliptic optimal control problems with L^1-control cost
- A new regularized quasi-Newton method for unconstrained optimization
- Efficent line search algorithm for unconstrained optimization
- An inexact alternating directions algorithm for constrained total variation regularized compressive sensing problems
- A new modified nonmonotone adaptive trust region method for unconstrained optimization
- An effective first order reliability method based on Barzilai-Borwein step
- Numerical study of a smoothing algorithm for the complementarity system over the second-order cone
- Projected nonmonotone search methods for optimization with orthogonality constraints
- A variant nonmonotone smoothing algorithm with improved numerical results for large-scale LWCPS
- A new nonmonotone line-search trust-region approach for nonlinear systems
- A Riemannian conjugate gradient method for optimization on the Stiefel manifold
- A nonmonotone PRP conjugate gradient method for solving square and under-determined systems of equations
- A new trust region method for solving least-square transformation of system of equalities and inequalities
- An accelerated active-set algorithm for a quadratic semidefinite program with general constraints
- A generalized worst-case complexity analysis for non-monotone line searches
- 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
- Two adaptive scaled gradient projection methods for Stiefel manifold constrained optimization
- New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization
- Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem
- A nonmonotone smoothing Newton algorithm for weighted complementarity problem
- 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
- Non-interior-point smoothing Newton method for CP revisited and its application to support vector machines
- An alternate gradient method for optimization problems with orthogonality constraints
- On the inexact scaled gradient projection method
- 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 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
- Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems
- Structured spectral algorithm with a nonmonotone line search for nonlinear least squares
- First-order methods for the convex hull membership problem
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
- Structured diagonal Gauss-Newton method for nonlinear least squares
- A cubic regularization of Newton's method with finite difference Hessian approximations
- A new subspace minimization conjugate gradient method based on conic model for large-scale unconstrained optimization
- LMBOPT: a limited memory method for bound-constrained optimization
- Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming
- 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
- An application-based characterization of dynamical distance geometry problems
- Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm
- A class of accelerated conjugate-gradient-like methods based on a modified secant equation
- Non-monotone inexact restoration method for nonlinear programming
- An efficient nonmonotone method for state-constrained elliptic optimal control problems
- Effective algorithms for solving trace minimization problem in multivariate statistics
- Multiple shooting-local linearization method for the identification of dynamical systems
- A derivative-free Liu-Storey method for solving large-scale nonlinear systems of equations
- A brief introduction to manifold optimization
- An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints
- A Riemannian nonmonotone spectral method for self-adjoint tangent vector field
- A hybrid method for solving systems of nonsmooth equations with box constraints
- A second-order gradient method for convex minimization
- A family of new smoothing functions and~a~nonmonotone smoothing Newton method for the nonlinear complementarity problems
- An inexact and nonmonotone proximal method for smooth unconstrained minimization
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
- A nonmonotone trust region method based on simple quadratic models
- Nonmonotone adaptive trust region method based on simple conic model for unconstrained optimization
- Nonmonotone adaptive trust region method with line search based on new diagonal updating
- A brief survey of methods for solving nonlinear least-squares problems
- Nonmonotone line searches for unconstrained multiobjective optimization problems
- An efficient nonmonotone adaptive cubic regularization method with line search for unconstrained optimization problem
- A matrix-free smoothing algorithm for large-scale support vector machines
- On efficiency of nonmonotone Armijo-type line searches
- A subspace minimization conjugate gradient method based on conic model for unconstrained optimization
- Accelerated augmented Lagrangian method for total variation minimization
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)
