Publication:5393506
From MaRDI portal
zbMath1209.90352MaRDI QIDQ5393506
Publication date: 18 April 2011
90C22: Semidefinite programming
90C29: Multi-objective and goal programming
90C48: Programming in abstract spaces
Related Items
Generalized Lexicographic MultiObjective Combinatorial Optimization. Application to Cryptography, Unnamed Item, Unnamed Item, Optimality characterizations for approximate nondominated and Fermat rules for nondominated solutions, Unnamed Item, Solving Multiobjective Mixed Integer Convex Optimization Problems, Foundations of Set-Semidefinite Optimization, The Nonlinear Separation Theorem and a Representation Theorem for Bishop–Phelps Cones, Bishop–Phelps cones given by an equation in Banach spaces, Numerical procedures in multiobjective optimization with variable ordering structures, Properly optimal elements in vector optimization with variable ordering structures, Geometrical and topological properties of a parameterized binary relation in vector optimization, Set approach for set optimization with variable ordering structures. II: Scalarization approaches, Inradius and circumradius of various convex cones arising in applications, Bilevel programming for generating discrete representations in multiobjective optimization, Vector topical function, abstract convexity and image space analysis, The Tikhonov regularization for vector equilibrium problems, Characterizations of the set less order relation in nonconvex set optimization, On the irreducibility, Lyapunov rank, and automorphisms of special Bishop-Phelps cones, A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints, A unified characterization of nonlinear scalarizing functionals in optimization, Existence and characterization theorems in nonconvex vector optimization, Estimates of Error Bounds for Some Sets of Efficient Solutions of a Set-Valued Optimization Problem, A Derivative-Free Approach to Constrained Multiobjective Nonsmooth Optimization
