An adaptive nonmonotone line search for multiobjective optimization problems
From MaRDI portal
Publication:2669601
Recommendations
- Nonmonotone line searches for unconstrained multiobjective optimization problems
- A new nonmonotone line search BFGS algorithm
- A quasi-Newton method with Wolfe line searches for multiobjective optimization
- Multicriteria optimization with a multiobjective golden section line search
- Quasi-Newton methods for multiobjective optimization problems
Cites work
- A method for constrained multiobjective optimization based on SQP techniques
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A projected gradient method for vector optimization problems
- A relaxed projection method for solving multiobjective optimization problems
- A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
- A super non-dominated point for multi-objective transportation problem
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- An augmented Lagrangian algorithm for multi-objective optimization
- An efficient sampling approach to multiobjective optimization
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- Barzilai and Borwein's method for multiobjective optimization problems
- Benchmarking optimization software with performance profiles.
- Dominating sets for convex functions with some applications
- Extension of Zoutendijk method for solving constrained multiobjective optimization problems
- Multicriteria Optimization
- Multicriteria optimization with a multiobjective golden section line search
- Multiple reduced gradient method for multiobjective optimization problems
- Newton's method for multiobjective optimization
- Nonmonotone gradient methods for vector optimization with a portfolio optimization application
- Nonmonotone line searches for unconstrained multiobjective optimization problems
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- On geometrical properties of preconditioners in IPMs for classes of block-angular problems
- On the extension of the Hager-Zhang conjugate gradient method for vector optimization
- On the nonmonotone line search
- Quasi-Newton methods for multiobjective optimization problems
- Quasi-Newton's method for multiobjective optimization
- Steepest descent methods for multicriteria optimization.
- Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem
Cited in
(12)- An adaptive penalty-based boundary intersection method for many-objective optimization problem
- An adaptive direct multisearch method for black-box multi-objective optimization
- Nonmonotone line searches for unconstrained multiobjective optimization problems
- scientific article; zbMATH DE number 4045171 (Why is no real title available?)
- A new nonmonotone spectral projected gradient algorithm for box-constrained optimization problems in m n real matrix space with application in image clustering
- A Barzilai-Borwein descent method for multiobjective optimization problems
- scientific article; zbMATH DE number 7780122 (Why is no real title available?)
- Accelerated nonmonotone line search technique for multiobjective optimization
- Two adaptive nonmonotone trust-region algorithms for solving multiobjective optimization problems
- Multicriteria optimization with a multiobjective golden section line search
- Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints
- A nonmonotone Polak-Ribière-Polyak conjugate gradient method for multiobjective optimization problems
This page was built for publication: An adaptive nonmonotone line search for multiobjective optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669601)
