Abstract

In this paper, a nonsmooth multiobjective semidefinite and semi-infinite programming is investigated.By using tangential subdifferentials for the tangential convex functions defined on the space of symmetric matrices, we establish the necessary and sufficient optimality conditions for some kind of efficient solutions of the nonsmooth multiobjective semidefinite and semi-infinite programming.

Keywords:
Karush–Kuhn–Tucker conditions Semidefinite programming Mathematical optimization Mathematics Semidefinite embedding Computer science Applied mathematics Quadratically constrained quadratic program Quadratic programming

Metrics

7
Cited By
1.50
FWCI (Field Weighted Citation Impact)
20
Refs
0.84
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Optimization and Variational Analysis
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Optimization and Mathematical Programming
Physical Sciences →  Engineering →  Control and Systems Engineering

Related Documents

JOURNAL ARTICLE

Strong Karush–Kuhn–Tucker optimality conditions for multiobjective semi-infinite programming

Le Thanh Tung

Journal:   Springer Link (Chiba Institute of Technology) Year: 2018
JOURNAL ARTICLE

Karush–Kuhn–Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints

Lê Thanh Tùng

Journal:   Annals of Operations Research Year: 2020 Vol: 311 (2)Pages: 1307-1334
JOURNAL ARTICLE

Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming with equilibrium constraints

Lê Thanh Tùng

Journal:   Yugoslav journal of operations research Year: 2020 Vol: 31 (4)Pages: 429-453
© 2026 ScienceGate Book Chapters — All rights reserved.