A Newton-Type Globally Convergent Interior-Point Method To Solve Multi-Objective Optimization Problems

DOI10.4208/jcm.2204-m2021-0241OpenAlexW4361802103MaRDI QIDQ6191876

Jauny, Debdas Ghosh, Ashutosh Upadhayay

Publication date: 12 February 2024

Published in: Journal of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4208/jcm.2204-m2021-0241

zbMATH Keywords

global convergenceinterior point methodNewton methodmerit functioncone method

Mathematics Subject Classification ID

Finite difference methods for boundary value problems involving PDEs (65N06) Acceleration of convergence in numerical analysis (65B99)

Cites Work

• The weighted sum method for multi-objective optimization: new insights
• Survey of multi-objective optimization methods for engineering
• On the global convergence of a modified augmented Lagrangian linesearch interior-point Newton method for nonlinear programming
• Test example for nonlinear programming codes
• A new Pareto set generating method for multi-criteria optimization problems
• Scalarizing vector optimization problems
• On the formulation and theory of the Newton interior-point method for nonlinear programming
• Analytical expressions for the eigenvalues and eigenvectors of the Hessian matrices of barrier and penalty functions
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• Adaptive Scalarization Methods in Multiobjective Optimization
• Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
• Symmetric Quasidefinite Matrices
• Multicriteria Optimization
• Linear programming. Foundations and extensions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Newton-Type Globally Convergent Interior-Point Method To Solve Multi-Objective Optimization Problems