An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems
From MaRDI portal
Publication:6164611
DOI10.1016/j.cor.2023.106236OpenAlexW4362586645MaRDI QIDQ6164611
Matthias Ehrgott, Ashutosh Upadhayay, Qamrul Hasan Ansari, Debdas Ghosh, Jauny
Publication date: 4 July 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2023.106236
multi-objective optimizationPareto optimalityinterior-point methodsmerit functionscone methodinfeasibility measures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modified NBI and NC method for the solution of \(N\)-multiobjective optimization problems
- A numerical method for constructing the Pareto front of multi-objective optimization problems
- The normalized normal constraint method for generating the Pareto frontier
- Survey of multi-objective optimization methods for engineering
- Adaptive weighted sum method for multiobjective optimization: a new method for Pareto front generation
- On the global convergence of a modified augmented Lagrangian linesearch interior-point Newton method for nonlinear programming
- A new polynomial-time algorithm for linear programming
- Feasibility issues in a primal-dual interior-point method for linear programming
- A gap between multiobjective optimization and scalar optimization
- A modified PRP conjugate gradient method
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- Interactive algorithm for multiobjective optimization
- An interior-point algorithm for nonconvex nonlinear programming
- A primal-dual infeasible-interior-point algorithm for linear programming
- Steepest descent methods for multicriteria optimization.
- A steepest descent method for vector optimization
- A new Pareto set generating method for multi-criteria optimization problems
- Scalarizing vector optimization problems
- A projected gradient method for vector optimization problems
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- Conditional gradient method for multiobjective optimization
- A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems
- On the extension of the Hager-Zhang conjugate gradient method for vector optimization
- Quasi-Newton's method for multiobjective optimization
- Inexact projected gradient method for vector optimization
- Globally convergent interior-point algorithm for nonlinear programming
- Newton's Method for Multiobjective Optimization
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- Physical programming - Effective optimization for computational design
- Vector Variational Inequalities and Vector Optimization
- Nonlinear Conjugate Gradient Methods for Vector Optimization
- Symmetric Quasidefinite Matrices
- Extended Newton Methods for Multiobjective Optimization: Majorizing Function Technique and Convergence Analysis
- Multicriteria Optimization
- Proximal Methods in Vector Optimization
- Evolutionary Multi-Criterion Optimization
- Linear programming. Foundations and extensions
