Optimality theorems for convex semidefinite vector optimization problems

DOI10.1016/J.NA.2009.05.064MaRDI QIDQ425863zbMATHOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 7546024
• scientific article; zbMATH DE number 7752927
• scientific article; zbMATH DE number 721757
• Constraint qualifications in convex vector semi-infinite optimization
• scientific article; zbMATH DE number 1552283

Cites work

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

Cited in

(6)

• scientific article; zbMATH DE number 7546024 (Why is no real title available?)
• On efficient solutions for semidefinite linear fractional vector optimization problems
• On the connections between semidefinite optimization and vector optimization
• scientific article; zbMATH DE number 5992448 (Why is no real title available?)
• Berge-type theorems for vector optimization problems
• scientific article; zbMATH DE number 7752927 (Why is no real title available?)

This page was built for publication: Optimality theorems for convex semidefinite vector optimization problems

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