Memory gradient method for multiobjective optimization
From MaRDI portal
Recommendations
- Combined gradient methods for multiobjective optimization
- Multiple-gradient descent algorithm (MGDA) for multiobjective optimization
- The memory gradient methods for unconstrained optimization
- A new variant of the memory gradient method for unconstrained optimization
- A memory gradient method based on the nonmonotone technique
- A memory gradient method for non-smooth convex optimization
- A gradient-based search method for multi-objective optimization problems
- scientific article; zbMATH DE number 6001261
Cites work
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Positive Barzilai–Borwein-Like Stepsize and an Extension for Symmetric Linear Systems
- A Wolfe Line Search Algorithm for Vector Optimization
- A bi-objective flexible flow shop scheduling problem with machine-dependent processing stages: trade-off between production costs and energy consumption
- A gradient-related algorithm with inexact line searches
- A memory gradient method based on the nonmonotone technique
- A modified Quasi-Newton method for vector optimization problem
- A new super-memory gradient method with curve search rule
- A new variant of the memory gradient method for unconstrained optimization
- A nonmonotone supermemory gradient algorithm for unconstrained optimization
- A study of Liu-Storey conjugate gradient methods for vector optimization
- A subgradient method for multiobjective optimization
- A subjective assessment of alternative mission architectures for the human exploration of Mars at NASA using multicriteria decision making.
- Adaptive Scalarization Methods in Multiobjective Optimization
- Barzilai and Borwein's method for multiobjective optimization problems
- Benchmarking optimization software with performance profiles.
- Box-constrained multi-objective optimization: A gradient-like method without ``a priori scalarization
- Complexity of gradient descent for multiobjective optimization
- Conditional gradient method for multiobjective optimization
- Convergence analysis of Tikhonov-type regularization algorithms for multiobjective optimization problems
- Direct Multisearch for Multiobjective Optimization
- Evolutionary Algorithms for Solving Multi-Objective Problems
- Extended Newton methods for multiobjective optimization: majorizing function technique and convergence analysis
- Global convergence of a memory gradient method for unconstrained optimization
- Globally convergent Newton-type methods for multiobjective optimization
- Multi-objective machine learning
- Multiple criteria decision aiding for finance: an updated bibliographic survey
- Newton's method for multiobjective optimization
- Nonlinear Conjugate Gradient Methods for Vector Optimization
- Nonmonotone line searches for unconstrained multiobjective optimization problems
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- OLAF -- a general modeling system to evaluate and optimize the location of an air polluting facility
- On the extension of the Hager-Zhang conjugate gradient method for vector optimization
- Optimization theory and methods. Nonlinear programming
- Quasi-Newton methods for multiobjective optimization problems
- Singular continuation: generating piecewise linear approximations to Pareto sets via global analysis
- Some methods of speeding up the convergence of iteration methods
- Steepest descent methods for multicriteria optimization.
- Study on a supermemory gradient method for the minimization of functions
- Supermemory descent methods for unconstrained minimization
- Survey of multi-objective optimization methods for engineering
Cited in
(12)- Methods of descent in multi-objective optimization. Paper from the 30th Brazilian mathematics colloquium -- 30\(^{\text o}\) Colóquio Brasileiro de Matemática, Rio de Janeiro, Brazil, July 26--31, 2015
- A globally convergent Riemannian memory gradient method
- Convergence of a new nonmonotone memory gradient method for unconstrained multiobjective optimization via robust approach
- A novel hybrid conjugate gradient method for multiobjective optimization problems
- A nonlinear conjugate gradient algorithm for multiobjective optimization: multiple hybrid search direction and global rates
- Improvements to steepest descent method for multi-objective optimization
- Memory gradient method for multiobjective optimization
- Alternative extension of the Hager–Zhang conjugate gradient method for vector optimization
- A three-term conjugate gradient-type method with sufficient descent property for vector optimization
- Spectral projected subgradient method with a 1-memory momentum term for constrained multiobjective optimization problem
- A gradient-based search method for multi-objective optimization problems
- A subspace minimization Barzilai-Borwein method for multiobjective optimization problems
This page was built for publication: Memory gradient method for multiobjective optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2700431)
