Explicit gradient information in multiobjective optimization

DOI10.1016/j.orl.2008.07.010zbMath1165.90620OpenAlexW2009409101MaRDI QIDQ2517803

Ubaldo M. García-Palomares, Francisco J. González-Castaño, Juan C. Burguillo-Rial

Publication date: 9 January 2009

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2008.07.010

zbMATH Keywords

necessary optimality conditionsmultiobjective optimizationPareto solution

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items

Reduced Jacobian method ⋮ A new reduced gradient method for solving linearly constrained multiobjective optimization problems

Cites Work

• Absolute value equation solution via linear programming
• Steepest descent methods for multicriteria optimization.
• A steepest descent method for vector optimization
• Preconditioning projection methods for solving algebraic linear systems
• On combining feasibility, descent and superlinear convergence in inequality constrained optimization
• A survey of recent developments in multiobjective optimization
• A global quadratic algorithm for solving a system of mixed equalities and inequalities
• New Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization