A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
From MaRDI portal
Publication:4651982
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)- Global convergence of a nonmonotone Broyden family method for nonconvex unconstrained minimization
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
- An exact penalty approach for optimization with nonnegative orthogonality constraints
- Several efficient gradient methods with approximate optimal stepsizes for large scale unconstrained optimization
- A regularization method for the second-order cone complementarity problem with the Cartesian \(P_0\)-property
- A memory gradient method based on the nonmonotone technique
- Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search
- A modified nonmonotone trust region line search method
- An approach based on dwindling filter method for positive definite generalized eigenvalue problem
- A subgradient method with non-monotone line search
- A line search trust-region algorithm with nonmonotone adaptive radius for a system of nonlinear equations
- A regularized limited memory subspace minimization conjugate gradient method for unconstrained optimization
- Numerical study of a smoothing algorithm for the complementarity system over the second-order cone
- An adaptive nonmonotone line search for multiobjective optimization problems
- A new class of nonmonotone adaptive trust-region methods for nonlinear equations with box constraints
- A nonmonotone line search method and its convergence for unconstrained optimization
- A cubic regularization of Newton's method with finite difference Hessian approximations
- Accelerated nonmonotone line search technique for multiobjective optimization
- A stabilized simulated annealing based Barzilai-Borwein method for the solution of unconstrained optimization problems
- An FE-inexact heterogeneous ADMM for elliptic optimal control problems with \(L^1\)-control cost
- A new adaptive trust-region method for system of nonlinear equations
- A relaxed nonmonotone adaptive trust region method for solving unconstrained optimization problems
- Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization
- Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search
- An affine-scaling interior-point CBB method for box-constrained optimization
- Inexact Newton-type methods based on Lanczos orthonormal method and application for full waveform inversion
- On the convergence of an active-set method for \(\ell_1\) minimization
- Notes on the Dai-Yuan-Yuan modified spectral gradient method
- A modified Hestenes-Stiefel conjugate gradient algorithm for large-scale optimization
- A memory gradient method for non-smooth convex optimization
- Nonmonotone inexact restoration approach for minimization with orthogonality constraints
- Convergence of nonmonotone line search method
- Complex-step derivative approximation in noisy environment
- A nonmonotonic hybrid algorithm for min-max problem
- Multiscale nonrigid point cloud registration using rotation-invariant sliced-Wasserstein distance via Laplace-Beltrami eigenmap
- A corrected Levenberg-Marquardt algorithm with a nonmonotone line search for the system of nonlinear equations
- scientific article; zbMATH DE number 4068627 (Why is no real title available?)
- A Barzilai-Borwein descent method for multiobjective optimization problems
- A nonmonotone smoothing-type algorithm for solving a system of equalities and inequalities
- A brief introduction to manifold optimization
- Search direction correction with normalized gradient makes first-order methods faster
- A Nonmonotone Smoothing-Type Algorithm for a System of Inequalities Associated with Circular Cones
- 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
- On determining radius in nonmonotone trust-region approaches
- A nonmonotone trust region method based on simple quadratic models
- Randomized algorithms for high quality treatment planning in volumetric modulated arc therapy
- A line search SQP method without a penalty or a filter
- A BFGS trust-region method with a new nonmonotone technique for nonlinear equations
- Convergence of derivative-free nonmonotone direct search methods for unconstrained and box-constrained mixed-integer optimization
- An approximate Newton-type proximal method using symmetric rank-one updating formula for minimizing the nonsmooth composite functions
- Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy
- AN EFFICIENT METHOD FOR SOLVING A CLASS OF MATRIX TRACE FUNCTION MINIMIZATION PROBLEM IN MULTIVARIATE STATISTICAL
- A new nonmonotone spectral projected gradient algorithm for box-constrained optimization problems in \(m \times n\) real matrix space with application in image clustering
- On the worst-case evaluation complexity of non-monotone line search algorithms
- A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques
- A new simple model trust-region method with generalized Barzilai-Borwein parameter for large-scale optimization
- An efficient descent direction method with cutting planes
- Gradient methods with adaptive step-sizes
- Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm
- Second-order adjoints for solving PDE-constrained optimization problems
- Effective algorithms for solving trace minimization problem in multivariate statistics
- An improved adaptive trust-region method for unconstrained optimization
- New line search methods for unconstrained optimization
- Correction of nonmonotone trust region algorithm based on a modified diagonal regularized quasi-Newton method
- New gradient methods with adaptive stepsizes by approximate models
- Two adaptive nonmonotone trust-region algorithms for solving multiobjective optimization problems
- A new family of conjugate gradient methods
- Adaptive quadratically regularized Newton method for Riemannian optimization
- A regularization semismooth Newton method based on the generalized Fischer-Burmeister function for \(P_0\)-NCPs
- 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
- A new nonmonotone filter Barzilai–Borwein method for solving unconstrained optimization problems
- A framework of constraint preserving update schemes for optimization on Stiefel manifold
- Nonmonotone local minimax methods for finding multiple saddle points
- A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search
- Folding-free global conformal mapping for genus-0 surfaces by harmonic energy minimization
- An adaptive Riemannian gradient method without function evaluations
- Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems
- A modified HS-DY-type method with nonmonotone line search for image restoration and unconstrained optimization problems
- An inexact quasi-Newton algorithm for large-scale \(\ell_1\) optimization with box constraints
- The generalized conditional gradient method for composite multiobjective optimization problems on Riemannian manifolds
- A simple sufficient descent method for unconstrained optimization
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Two accelerated nonmonotone adaptive trust region line search methods
- A nonmonotone hybrid conjugate gradient method for unconstrained optimization
- A second-order gradient method for convex minimization
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
- A non-monotone line search algorithm for unconstrained optimization
- A spectral gradient projection method for the positive semi-definite procrustes problem
- A non-monotone regularization Newton method for the second-order cone complementarity problem
- Non monotone algorithms for unconstrained minimization: upper bounds on function values
- On the steplength selection in gradient methods for unconstrained optimization
- New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization
- Spectral residual method for nonlinear equations on Riemannian manifolds
- A nonmonotone smoothing Newton method for circular cone programming
- Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems
- \(L_p\)-norm regularization algorithms for optimization over permutation matrices
- An efficient algorithm for solving a class of matrix optimization problem in scalable probabilistic approximation
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)
