Box-constrained multi-objective optimization: A gradient-like method without ``a priori scalarization

DOI10.1016/j.ejor.2007.05.015zbMath1144.90482OpenAlexW1970895334MaRDI QIDQ2475812

Elena Molho, Maria Cristina Recchioni, Enrico Miglierina

Publication date: 11 March 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2007.05.015

zbMATH Keywords

interior point methodmultiple objective programminggradient-like methodpseudogradientdescent directions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (21)

A study of Liu-Storey conjugate gradient methods for vector optimization ⋮ A modified Quasi-Newton method for vector optimization problem ⋮ Inertial forward–backward methods for solving vector optimization problems ⋮ Using first-order information in direct multisearch for multiobjective optimization ⋮ A quasi-Newton method with Wolfe line searches for multiobjective optimization ⋮ From bond yield to macroeconomic instability: a parsimonious affine model ⋮ Spectral conjugate gradient methods for vector optimization problems ⋮ On the extension of the Hager-Zhang conjugate gradient method for vector optimization ⋮ Memory gradient method for multiobjective optimization ⋮ A limited memory quasi-Newton approach for multi-objective optimization ⋮ The self regulation problem as an inexact steepest descent method for multicriteria optimization ⋮ Conditional gradient method for multiobjective optimization ⋮ Nonlinear Conjugate Gradient Methods for Vector Optimization ⋮ A new scalarization method for finding the efficient frontier in non-convex multi-objective problems ⋮ Improving the identification of general Pareto fronts by global optimization ⋮ A sequential quadratic programming method for constrained multi-objective optimization problems ⋮ Solving generalized convex multiobjective programming problems by a normal direction method ⋮ A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems ⋮ Globally convergent Newton-type methods for multiobjective optimization ⋮ A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization ⋮ Steepest descent methods for critical points in vector optimization problems

Uses Software

• NBI

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A quadratically convergent method for linear programming
• Theory of multiobjective optimization
• Existence theorems in vector optimization
• Generalized concavity
• Augmented Lagrangian and Tchebycheff approaches in multiple objective programming
• Steepest descent methods for multicriteria optimization.
• Multiple criteria optimization: State of the art annotated bibliographic surveys
• A path following method for box-constrained multiobjective optimization with applications to goal programming problems
• Monotone variable-metric algorithm for linearly constrained nonlinear programming
• A stochastic algorithm for constrained global optimization
• Introducing oblique norms into multiple criteria programming
• A steepest descent method for vector optimization
• Generating well-distributed sets of Pareto points for engineering design using physical programming
• Slow solutions of a differential inclusion and vector optimization
• A projected gradient method for vector optimization problems
• Proper efficiency and the theory of vector maximization
• Use of \(P_ \tau\)-nets for the approximation of the Edgeworth-Pareto set in multicriteria optimization
• Global multiobjective optimization using evolutionary algorithms
• ``MOSS multiobjective scatter search applied to nonlinear multiple criteria optimization
• An interior point algorithm for global optimal solutions and KKT points
• Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
• Nonlinear goal programming using multi-objective genetic algorithms
• Proximal Methods in Vector Optimization
• Generalized homotopy approach to multiobjective optimization.

This page was built for publication: Box-constrained multi-objective optimization: A gradient-like method without ``a priori scalarization