Optimality theorems for convex semidefinite vector optimization problems

DOI10.1016/j.na.2009.05.064zbMath1239.90094OpenAlexW2070056559MaRDI QIDQ425863

Gue Myung Lee, Kwang Baik Lee

Publication date: 9 June 2012

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.na.2009.05.064

zbMATH Keywords

optimality conditionsefficient solutionsconvex semidefinite vector optimization problem

Mathematics Subject Classification ID

Semidefinite programming (90C22) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficiency and proper efficiency in nonlinear vector maximum problems
• Theory of multiobjective optimization
• Asymptotic dual conditions characterizing optimality for infinite convex programs
• Dual conditions characterizing optimality for convex multi-objective programs.
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• Proper efficiency and the theory of vector maximization
• Technical Note—Proper Efficiency and the Linear Fractional Vector Maximum Problem
• Pseudolinearity and efficiency
• A new scalar equivalence for Pareto optimization
• On the Shannon capacity of a graph
• Linear Matrix Inequalities in System and Control Theory
• On efficiency in nonlinear fractional vector maximization problem
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Variational Analysis
• Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
• Strong Duality for Semidefinite Programming
• New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
• Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization
• Efficiency in linear fractional vector maximization problem with nonlinear constraints
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• Semidefinite Programming
• Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
• ON OPTIMALITY CONDITIONS FOR ABSTRACT CONVEX VECTOR OPTIMIZATION PROBLEMS
• On the Subdifferentiability of Convex Functions
• Handbook of semidefinite programming. Theory, algorithms, and applications
• On copositive programming and standard quadratic optimization problems