Optimality theorems for convex semidefinite vector optimization problems
type: Item
instance of: scholarly article
title: Optimality theorems for convex semidefinite vector optimization problems
zbMATH Open document ID: 1239.90094
author: Gue Myung Lee
author: Kwang Baik Lee
published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods
publication date: 2012-06-09T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 6044687
zbMATH Keywords: convex semidefinite vector optimization problem
zbMATH Keywords: efficient solutions
zbMATH Keywords: optimality conditions
MaRDI profile type: Publication
full work available at URL: j.na.2009.05.064
OpenAlex ID: W2070056559
cites work: Linear Matrix Inequalities in System and Control Theory
cites work: On copositive programming and standard quadratic optimization problems
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
cites work: On the Shannon capacity of a graph
cites work: Q4347849
cites work: Aspects of semidefinite programming. Interior point algorithms and selected applications
cites work: Q4504773
cites work: Semidefinite Programming
cites work: Handbook of semidefinite programming. Theory, algorithms, and applications
cites work: Strong Duality for Semidefinite Programming
cites work: Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization
cites work: Dual conditions characterizing optimality for convex multi-objective programs.
cites work: New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
cites work: ON OPTIMALITY CONDITIONS FOR ABSTRACT CONVEX VECTOR OPTIMIZATION PROBLEMS
cites work: Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
cites work: Pseudolinearity and efficiency
cites work: Technical Note—Proper Efficiency and the Linear Fractional Vector Maximum Problem
cites work: Efficiency in linear fractional vector maximization problem with nonlinear constraints
cites work: Efficiency and proper efficiency in nonlinear vector maximum problems
cites work: On efficiency in nonlinear fractional vector maximization problem
cites work: Q3701188
cites work: Theory of multiobjective optimization
cites work: Variational Analysis
cites work: Q3149262
cites work: A new scalar equivalence for Pareto optimization
cites work: Proper efficiency and the theory of vector maximization
cites work: Q3858773
cites work: On the Subdifferentiability of Convex Functions
cites work: Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
cites work: Asymptotic dual conditions characterizing optimality for infinite convex programs
DOI: 10.1016/J.NA.2009.05.064
description: scientific article; zbMATH DE number 6044687