EURO Journal on Computational Optimization, 2015 Quantified linear programs (QLPs) are linear programs with variables being either existentially or universally quantified. QLPs are convex multistage decision problems on the one side, and two-person zero-sum games between an existential and a universal ...
Ulf Lorenz, Jan Wolf
doaj +1 more source
Characterizations of Benson proper efficiency of set-valued optimization in real linear spaces
Open Mathematics, 2019 A new class of generalized convex set-valued maps termed relatively solid generalized cone-subconvexlike maps is introduced in real linear spaces not equipped with any topology.
Liang Hongwei, Wan Zhongping
doaj +1 more source
A delimitation of the support of optimal designs for Kiefer's $\phi_p$-class of criteria [PDF]
, 2013 The paper extends the result of Harman and Pronzato [Stat. & Prob. Lett., 77:90--94, 2007], which corresponds to $p=0$, to all strictly concave criteria in Kiefer's $\phi_p$-class.
Pronzato, Luc
core +5 more sources
Exact duality in semidefinite programming based on elementary reformulations [PDF]
, 2015 In semidefinite programming (SDP), unlike in linear programming, Farkas' lemma may fail to prove infeasibility. Here we obtain an exact, short certificate of infeasibility in SDP by an elementary approach: we reformulate any semidefinite system of the ...
Liu, Minghui, Pataki, Gabor
core +3 more sources
On the Aubin property of a class of parameterized variational systems [PDF]
, 2017 The paper deals with a new sharp criterion ensuring the Aubin property of solution maps to a class of parameterized variational systems. This class includes parameter-dependent variational inequalities with non-polyhedral constraint sets and also ...
Gfrerer, Helmut, Outrata, Jiří V
core +3 more sources
Exact upper and lower bounds on the difference between the arithmetic and geometric means
, 2015 Let $X$ denote a nonnegative random variable with $\mathsf{E ...
Pinelis, Iosif
core +1 more source
On the Triality Theory for a Quartic Polynomial Optimization Problem [PDF]
, 2011 This paper presents a detailed proof of the triality theorem for a class of fourth-order polynomial optimization problems. The method is based on linear algebra but it solves an open problem on the double-min duality left in 2003.
A. Jaffe +13 more
core +1 more source
On the Duality of Semiantichains and Unichain Coverings [PDF]
, 2014 We study a min-max relation conjectured by Saks and West: For any two posets $P$ and $Q$ the size of a maximum semiantichain and the size of a minimum unichain covering in the product $P\times Q$ are equal. For positive we state conditions on $P$ and $Q$
Bart Lomiej Bosek +4 more
core
Characterizations of minimal elements of upper support with applications in minimizing DC functions
Open MathematicsIn this study, we discuss on the problem of minimizing the differences of two non-positive valued increasing, co-radiant and quasi-concave (ICRQC) functions defined on XX (where XX is a real locally convex topological vector space).
Mirzadeh Somayeh +2 more
doaj +1 more source
Smooth Value Functions for a Class of Nonsmooth Utility Maximization Problems [PDF]
, 2010 In this paper we prove that there exists a smooth classical solution to the HJB equation for a large class of constrained problems with utility functions that are not necessarily differentiable or strictly concave.
Bian, Baojun, Miao, Sheng, Zheng, Harry
core +1 more source