Vector Duality for Set-Semidefinite Multiobjective Optimization Problems

Sorin-Mihai Grad; Lidia Höpfner

doi:10.53941/ams.2026.100008

Abstract

In this note we extend a vector duality approach for set-semidefinite multiobjective optimization problems consisting in the vector minimization with respect to a given convex cone of matrices of a matrix-valued function subject to both geometric and set-semidefinite cone-inequality constraints. Our contribution generalizes and improves earlier results from the literature.

References

1.
Eichfelder, G.; Jahn, J. Set-semidefinite optimization. J. Convex Anal. 2008, 15, 767–801.
2.
Eichfelder, G.; Jahn, J. Foundations of set-semidefinite optimization. In Nonlinear Analysis and Variational Problems; Springer Optimization and Its Applications; Springer: New York, NY, USA, 2010; Volume 35, pp. 259–284.
3.
Grad, S.M. Duality for multiobjective semidefinite optimization problems. In Operations Research Proceedings 2014, Springer: Cham, Switzerland, 2016; pp. 189–195.
4.
Grad, S.M. Vector Optimization and Monotone Operators via Convex Duality; Springer: Berlin/Heidelberg, Germany, 2015.
5.
Grana Drummond, L.M.; Iusem, A.N. First order conditions for ideal minimization of matrix-valued problems. J. Convex Anal. 2003, 10, 1–19.
6.
Grana Drummond, L.M.; Iusem, A.N.; Svaiter, B.F. On first order optimality conditions for vector optimization. Acta Math. Appl. Sin. Engl. Ser. 2003, 19, 371–386.
7.
Krafft, O. A matrix optimization problem. Linear Algebra Appl. 1983, 51, 137–142.
8.
Wanka, G.; Bot, R.I.; Grad, S.M. Multiobjective duality for convex semidefinite programming problems. Z. Anal. Anwend. 2003, 22, 711–728.
9.
Bot, R.I.; Grad, S.M. On linear vector optimization duality in infinite-dimensional spaces. Numer. Algebra Control Optim. 2011, 1, 407–415.
10.
Bot, , R.I.; Grad, S.M.; Wanka, G. Classical linear vector optimization duality revisited. Optim. Lett. 2012, 6, 199–210.
11.
Wanka, G.; Bot, R.I. A new duality approach for multiobjective convex optimization problems. J. Nonlinear Convex Anal. 2002, 3, 41–57.
12.
Helmberg, C. Semidefinite programming. Eur. J. Oper. Res. 2002, 137, 461–482.
13.
Dur, M.; Rendl, F. Conic optimization: A survey with special focus on copositive optimization and binary quadratic problems. EURO J. Comput. Optim. 2021, 9, 100021.
14.
Bot, , R.I.; Grad, S.M.; Wanka, G. Duality in Vector Optimization; Springer: Berlin/Heidelberg, Germany, 2009.
15.
Bot, R.I.; Grad, S.M. Duality for vector optimization problems via a general scalarization. Optimization 2011, 60, 1269–1290.
16.
Grad, S.M. Closedness type regularity conditions in convex optimization and beyond. Front. Appl. Math. Stat. 2016, 2, 14.

Scilight Press

Author Information

Abstract

Keywords

References

About Scilight

Journals

Publishing Policies

Contact Us