Nonmonotone line searches for unconstrained multiobjective optimization problems
From MaRDI portal
Publication:2274871
DOI10.1007/S10898-019-00802-0zbMATH Open1428.90155OpenAlexW2960169247MaRDI QIDQ2274871FDOQ2274871
Authors: Kanako Mita, Ellen H. Fukuda, Nobuo Yamashita 
Publication date: 1 October 2019
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-019-00802-0
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
multiobjective optimizationPareto optimalityNewton methodsteepest descent methodnonmonotone line search
Cites Work
- Testing Unconstrained Optimization Software
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- Benchmarking optimization software with performance profiles.
- Updating Quasi-Newton Matrices with Limited Storage
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- Steepest descent methods for multicriteria optimization.
- Newton's method for multiobjective optimization
- Scalarization of vector optimization problems
- Nonmonotone gradient methods for vector optimization with a portfolio optimization application
- Sublinear scalarization methods for sets with respect to set-relations
- Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems
Cited In (28)
- Conditional 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
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
- A nonmonotone gradient method for constrained multiobjective optimization problems
- Accelerated nonmonotone line search technique for multiobjective optimization
- An adaptive nonmonotone line search for multiobjective optimization problems
- An accelerated proximal gradient method for multiobjective optimization
- Nonlinear biobjective optimization: improving the upper envelope using feasible line segments
- A Barzilai-Borwein descent method for multiobjective optimization problems
- Conditional gradient method for multiobjective optimization
- Two adaptive nonmonotone trust-region algorithms for solving multiobjective optimization problems
- On the extension of the Hager-Zhang conjugate gradient method for vector optimization
- Spectral conjugate gradient methods for vector optimization problems
- The generalized conditional gradient method for composite multiobjective optimization problems on Riemannian manifolds
- Nonmonotone line search for minimax problems
- A quasi-Newton method with Wolfe line searches for multiobjective optimization
- Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization
- A family of conjugate gradient methods with guaranteed positiveness and descent for vector optimization
- A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization
- Alternative extension of the Hager–Zhang conjugate gradient method for vector optimization
- Augmented Lagrangian cone method for multiobjective optimization problems with an application to an optimal control problem
- Nonlinear and unconstrained multiple-objective optimization: Algorithm, computation, and application
- 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
- Globally convergent Newton-type methods for multiobjective optimization
- Memory gradient method for multiobjective optimization
- A nonmonotone projected gradient method for multiobjective problems on convex sets
Uses Software
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)
