A subgradient supported ellipsoid method for convex multiobjective optimization problems

DOI10.1007/S12597-024-00849-YMaRDI QIDQ6890569zbMATH OpenFDO

Authors M. Muthukani, P. Paramanathan

Publication date 3 December 2025

Published in Opsearch (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S12597-024-00849-Y

zbMATH Keywords

ellipsoid methodmulti objective optimizationscalarization proceduresubgradient

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A cutting-plane method to nonsmooth multiobjective optimization problems
• A deep cut ellipsoid algorithm for convex programming: Theory and applications
• A direct ellipsoid method for linear programming
• A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems
• Convergence Rates of the Ellipsoid Method on General Convex Functions
• Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
• scientific article; zbMATH DE number 592626 (Why is no real title available?)
• Karmarkar's algorithm and the ellipsoid method
• Modifications and implementation of the ellipsoid algorithm for linear programming
• On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid
• On the linear weighted sum method for multi-objective optimization
• Polynomial algorithms in linear programming
• Quasi-Newton's method for multiobjective optimization
• Subgradient ellipsoid method for nonsmooth convex problems
• The ellipsoid method and its consequences in combinatorial optimization

This page was built for publication: A subgradient supported ellipsoid method for convex multiobjective optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6890569)