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)- New BFGS method for unconstrained optimization problem based on modified armijo line search
- A new modified nonmonotone adaptive trust region method for unconstrained optimization
- A new nonmonotone line search technique for unconstrained optimization
- A nonmonotone scaled conjugate gradient algorithm for large-scale unconstrained optimization
- scientific article; zbMATH DE number 5926248 (Why is no real title available?)
- A trust-region method using extended nonmonotone technique for unconstrained optimization
- An adaptive trust region method based on simple conic models
- A derivative-free PRP method for solving large-scale nonlinear systems of equations and its global convergence
- Gradient methods exploiting spectral properties
- An effective first order reliability method based on Barzilai-Borwein step
- A Modified PRP Conjugate Gradient Algorithm with Trust Region for Optimization Problems
- A new cubic convergent method for solving a system of nonlinear equations
- Alternating cyclic vector extrapolation technique for accelerating nonlinear optimization algorithms and fixed-point mapping applications
- A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems
- A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints
- Adaptive nonmonotone line search method for unconstrained optimization
- A matrix-free smoothing algorithm for large-scale support vector machines
- On efficiency of nonmonotone Armijo-type line searches
- An efficient adaptive trust-region method for systems of nonlinear equations
- A new algorithm with structured diagonal Hessian approximation for solving nonlinear least squares problems and application to robotic motion control
- A globally convergent BFGS method with nonmonotone line search for non-convex minimization
- Riemannian Optimization on the Symplectic Stiefel Manifold
- A nonmonotone approximate sequence algorithm for unconstrained nonlinear optimization
- A nonmonotone weighting self-adaptive trust region algorithm for unconstrained nonconvex optimization
- A new regularized quasi-Newton method for unconstrained optimization
- Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
- A variant nonmonotone smoothing algorithm with improved numerical results for large-scale LWCPS
- A modified three-term conjugate gradient method with sufficient descent property
- First-order methods for the convex hull membership problem
- Structured spectral algorithm with a nonmonotone line search for nonlinear least squares
- A nonmonotone line search for the LBFGS method in parabolic optimal control problems
- A nonmonotone spectral projected gradient method for tensor eigenvalue complementarity problems
- Structured diagonal Gauss-Newton method for nonlinear least squares
- Smoothing inexact Newton method based on a new derivative-free nonmonotone line search for the NCP over circular cones
- A derivative-free Liu-Storey method for solving large-scale nonlinear systems of equations
- A diagonally scaled Newton-type proximal method for minimization of the models with nonsmooth composite cost functions
- Incorporating nonmonotone strategies into the trust region method for unconstrained optimization
- Projected nonmonotone search methods for optimization with orthogonality constraints
- An efficient nonmonotone adaptive cubic regularization method with line search for unconstrained optimization problem
- A hybrid BB-type method for solving large scale unconstrained optimization
- Conditional gradient method for vector optimization
- An ODE-based nonmonotone method for unconstrained optimization problems
- Nonmonotone adaptive trust region method with line search based on new diagonal updating
- An accelerated active-set algorithm for a quadratic semidefinite program with general constraints
- An efficient nonmonotone trust-region method for unconstrained optimization
- An inexact nonmonotone projected gradient method for constrained multiobjective optimization
- Convergence of a new nonmonotone memory gradient method for unconstrained multiobjective optimization via robust approach
- A nonmonotone smoothing Newton algorithm for weighted complementarity problem
- A boosted DC algorithm for non-differentiable DC components with non-monotone line search
- Efficient projected gradient methods for cardinality constrained optimization
- An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization
- A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimization
- A new generalized shrinkage conjugate gradient method for sparse recovery
- Proximal gradient methods beyond monotony
- A nonmonotone PSB algorithm for solving unconstrained optimization
- A two-stage active-set algorithm for bound-constrained optimization
- An efficient augmented Lagrangian method with applications to total variation minimization
- A conjugate gradient method with descent direction for unconstrained optimization
- A nonmonotone trust region method based on simple conic models for unconstrained optimization
- A new restarting adaptive trust-region method for unconstrained optimization
- A class of nonmonotone armijo-type line search method for unconstrained optimization
- The convergence of conjugate gradient method with nonmonotone line search
- A NONMONOTONE ADMM-BASED DIAGONAL QUASI-NEWTON UPDATE WITH APPLICATION TO THE COMPRESSIVE SENSING PROBLEM
- A class of modified accelerated proximal gradient methods for nonsmooth and nonconvex minimization problems
- An active set algorithm for nonlinear optimization with polyhedral constraints
- A hybrid of adjustable trust-region and nonmonotone algorithms for unconstrained optimization
- Forward-backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms
- Fast minimization of region-based active contours using the shape Hessian of the energy
- A derivative-free nonmonotone line-search technique for unconstrained optimization
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
- A Riemannian nonmonotone spectral method for self-adjoint tangent vector field
- A hybrid method for solving systems of nonsmooth equations with box constraints
- Smoothing projected cyclic Barzilai–Borwein method for stochastic linear complementarity problems
- A nonmonotone Levenberg-Marquardt method for nonlinear complementarity problems under local error bound
- A nonmonotone gradient method for constrained multiobjective optimization problems
- On the rate of convergence of projected Barzilai-Borwein methods
- An adaptive nonmonotone trust-region method with curvilinear search for minimax problem
- An adaptive nonmonotone global Barzilai–Borwein gradient method for unconstrained optimization
- Two preprocessing algorithms for climate time series
- Nonmonotone trust region algorithm for unconstrained optimization problems
- Efficent line search algorithm for unconstrained optimization
- Low-rank spectral optimization via gauge duality
- Nonmonotone line search methods with variable sample size
- On the convergence rate of scaled gradient projection method
- Non-monotone projection gradient method for non-negative matrix factorization
- A non-monotone pattern search approach for systems of nonlinear equations
- Fast gradient algorithm with dry-like friction and nonmonotone line search for nonconvex optimization problems
- New vector transport operators extending a Riemannian CG algorithm to generalized Stiefel manifold with low-rank applications
- Nonmonotone conic trust region method with line search technique for bound constrained optimization
- Strong convergence analysis of the new relaxation nonmonotone line search algorithm
- A new trust region method for solving least-square transformation of system of equalities and inequalities
- Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation
- Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem
- A damped Gauss-Newton method for the second-order cone complementarity problem
- Strong convergence properties of a modified nonmonotone smoothing algorithm for the SCCP
- Two modified adaptive cubic regularization algorithms by using the nonmonotone Armijo-type line search
- Convergence of a Class of Nonmonotone Descent Methods for Kurdyka–Łojasiewicz Optimization Problems
- A collection of efficient retractions for the symplectic Stiefel manifold
- Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming
- A nonmonotone PRP conjugate gradient method for solving square and under-determined systems of equations
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)
