Algorithms for multicriterion optimization
From MaRDI portal
Cited in
(18)- Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints
- The multiobjective steepest descent direction is not Lipschitz continuous, but is Hölder continuous
- Matrix criterion robust linear quadratic control problem
- Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization
- Survey of Bundle Methods for Nonsmooth Optimization
- Interactive bundle-based method for nondifferentiable multiobjeective optimization: nimbus§
- Variable metric method for unconstrained multiobjective optimization problems
- A Barzilai-Borwein descent method for multiobjective optimization problems
- Fast convergence of inertial multiobjective gradient-like systems with asymptotic vanishing damping
- MultiSQP-GS: a sequential quadratic programming algorithm via gradient sampling for nonsmooth constrained multiobjective optimization
- Preconditioned Barzilai-Borwein methods for multiobjective optimization problems
- A subspace minimization Barzilai-Borwein method for multiobjective optimization problems
- On the convergence of Newton-type proximal gradient method for multiobjective optimization problems
- A reduced Jacobian method with full convergence property
- An explicit three-term Polak-Ribière-Polyak conjugate gradient method for bicriteria optimization
- An explicit spectral Fletcher-Reeves conjugate gradient method for bi-criteria optimization
- Common pitfalls to avoid while using multiobjective optimization in machine learning
- A Levenberg-Marquardt algorithm for unconstrained multicriteria optimization
This page was built for publication: Algorithms for multicriterion optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3865870)