Memory gradient method for multiobjective optimization
From MaRDI portal
Publication:2700431
DOI10.1016/j.amc.2022.127791OpenAlexW4313255493MaRDI QIDQ2700431
Wang Chen, Yong Zhao, Yang, Xinmin
Publication date: 21 April 2023
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.00496
convergence analysismultiobjective optimizationdescent directionPareto criticalmemory gradient method
Mathematical programming (90Cxx) Numerical methods in optimal control (49Mxx) Numerical methods for mathematical programming, optimization and variational techniques (65Kxx)
Uses Software
Cites Work
- Multiple criteria decision aiding for finance: an updated bibliographic survey
- Survey of multi-objective optimization methods for engineering
- A gradient-related algorithm with inexact line searches
- A nonmonotone supermemory gradient algorithm for unconstrained optimization
- Global convergence of a memory gradient method for unconstrained optimization
- Convergence analysis of Tikhonov-type regularization algorithms for multiobjective optimization problems
- Supermemory descent methods for unconstrained minimization
- Steepest descent methods for multicriteria optimization.
- A subjective assessment of alternative mission architectures for the human exploration of Mars at NASA using multicriteria decision making.
- Quasi-Newton methods for multiobjective optimization problems
- A new variant of the memory gradient method for unconstrained optimization
- Conditional gradient method for multiobjective optimization
- Globally convergent Newton-type methods for multiobjective optimization
- A study of Liu-Storey conjugate gradient methods for vector optimization
- On the extension of the Hager-Zhang conjugate gradient method for vector optimization
- Nonmonotone line searches for unconstrained multiobjective optimization problems
- Multi-objective machine learning
- A subgradient method for multiobjective optimization
- Box-constrained multi-objective optimization: A gradient-like method without ``a priori scalarization
- Optimization theory and methods. Nonlinear programming
- Study on a supermemory gradient method for the minimization of functions
- A new super-memory gradient method with curve search rule
- A memory gradient method based on the nonmonotone technique
- Barzilai and Borwein's method for multiobjective optimization problems
- A bi-objective flexible flow shop scheduling problem with machine-dependent processing stages: trade-off between production costs and energy consumption
- Singular Continuation: Generating Piecewise Linear Approximations to Pareto Sets via Global Analysis
- Direct Multisearch for Multiobjective Optimization
- A modified Quasi-Newton method for vector optimization problem
- A Positive Barzilai–Borwein-Like Stepsize and an Extension for Symmetric Linear Systems
- Adaptive Scalarization Methods in Multiobjective Optimization
- Newton's Method for Multiobjective Optimization
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Nonlinear Conjugate Gradient Methods for Vector Optimization
- A Wolfe Line Search Algorithm for Vector Optimization
- Complexity of gradient descent for multiobjective optimization
- Extended Newton Methods for Multiobjective Optimization: Majorizing Function Technique and Convergence Analysis
- Evolutionary Algorithms for Solving Multi-Objective Problems
- Some methods of speeding up the convergence of iteration methods
- OLAF -- a general modeling system to evaluate and optimize the location of an air polluting facility
- Benchmarking optimization software with performance profiles.
