Nonmonotone line searches for unconstrained multiobjective optimization problems
From MaRDI portal
Recommendations
- An adaptive nonmonotone line search for multiobjective optimization problems
- A nonmonotone gradient method for constrained multiobjective optimization problems
- On the convergence of steepest descent methods for multiobjective optimization
- Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization
- Nonmonotone trust region algorithm for solving the unconstrained multiobjective optimization problems
Cites work
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- Benchmarking optimization software with performance profiles.
- Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems
- Newton's method for multiobjective optimization
- Nonmonotone gradient methods for vector optimization with a portfolio optimization application
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- Scalarization of vector optimization problems
- Steepest descent methods for multicriteria optimization.
- Sublinear scalarization methods for sets with respect to set-relations
- Testing Unconstrained Optimization Software
- Updating Quasi-Newton Matrices with Limited Storage
Cited in
(47)- Nonmonotone line search for minimax problems
- Nonlinear biobjective optimization: improving the upper envelope using feasible line segments
- Conditional gradient method for multiobjective optimization
- Globally convergent Newton-type methods for multiobjective optimization
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
- A quasi-Newton method with Wolfe line searches for multiobjective optimization
- On the extension of the Hager-Zhang conjugate gradient method for vector optimization
- An adaptive nonmonotone line search for multiobjective optimization problems
- Memory gradient method for multiobjective optimization
- Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization
- Nonlinear and unconstrained multiple-objective optimization: Algorithm, computation, and application
- A nonmonotone gradient method for constrained multiobjective optimization problems
- A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization
- Augmented Lagrangian cone method for multiobjective optimization problems with an application to an optimal control problem
- An accelerated proximal gradient method for multiobjective optimization
- Spectral conjugate gradient methods for vector optimization problems
- The generalized conditional gradient method for composite multiobjective optimization problems on Riemannian manifolds
- Conditional gradient method for vector optimization
- A Barzilai-Borwein descent method for multiobjective optimization problems
- Alternative extension of the Hager–Zhang conjugate gradient method for vector optimization
- Convergence of a new nonmonotone memory gradient method for unconstrained multiobjective optimization via robust approach
- A line search technique for a class of multi-objective optimization problems using subgradient
- A nonmonotone projected gradient method for multiobjective problems on convex sets
- Accelerated nonmonotone line search technique for multiobjective optimization
- Two adaptive nonmonotone trust-region algorithms for solving multiobjective optimization problems
- A family of conjugate gradient methods with guaranteed positiveness and descent for vector optimization
- Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints
- A non-monotone proximal gradient algorithm for solving nonsmooth multiobjective optimization problems with an extending application to robust multiobjective optimization
- Two modified hybrid conjugate gradient methods for nonconvex vector optimization
- A nonmonotone line search method for constrained multiobjective optimization problems
- A hybrid gradient method for vector optimization problems
- A weighted hybrid conjugate gradient method for unconstrained multiobjective optimization problems.
- A proximal gradient method with an explicit line search for multiobjective optimization
- Improvements to steepest descent method for multi-objective optimization
- A three-term conjugate gradient-type method with sufficient descent property for vector optimization
- The Dai–Liao-type conjugate gradient methods for solving vector optimization problems
- An explicit three-term Polak-Ribière-Polyak conjugate gradient method for bicriteria optimization
- Convergence and complexity guarantees for a wide class of descent algorithms in nonconvex multi-objective optimization
- Nonmonotone proximal gradient method for composite multiobjective optimization problems
- On the convergence analysis of a proximal gradient method for multiobjective optimization
- Proximal gradient method for convex multiobjective optimization problems without Lipschitz continuous gradients
- A generalized conditional gradient method for multiobjective composite optimization problems
- Nonmonotone Wolfe-type quasi-Newton methods for multiobjective optimization problems
- An exact penalty method with nonmonotone line search and rapid infeasibility detection for constrained multiobjective optimization: application in supervised machine learning
- An accelerated method for solving constrained multi-objective optimization
- A nonmonotone Polak-Ribière-Polyak conjugate gradient method for multiobjective optimization problems
- A nonmonotone front descent method for bound-constrained multi-objective optimization
This page was built for publication: Nonmonotone line searches for unconstrained multiobjective optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2274871)
