Results 31 to 40 of about 514 (86)

Topical functions: Hermite-Hadamard type inequalities and Kantorovich duality

, 2018
For a certain class of elementary functions consisting of min-type functions, we apply techniques from abstract convex analysis to study Hermite-Hadamard type inequalities for increasing and plus-homogeneous (topical) functions.
M. Daryaei, A. R. Doagooei
semanticscholar   +1 more source

SOME RESULTS OF DUALITY IN FUZZY LINEAR PROGRAMMING

, 2016
In this paper, based on linear ranking functions we investigate some properties for the fuzzy number linear programming problems and its dual with the relationships between them.
S. Hosaeni, J. Cheshmavar
semanticscholar   +1 more source

Convex Optimal Uncertainty Quantification [PDF]

, 2015
Optimal uncertainty quantification (OUQ) is a framework for numerical extreme-case analysis of stochastic systems with imperfect knowledge of the underlying probability distribution.
Han, Shuo, Murray, Richard M., Owhadi, Houman, Tao, Molei, Topcu, Ufuk   +4 more
core   +3 more sources

Characterizations of minimal elements of upper support with applications in minimizing DC functions

Open Mathematics
In 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, Barsam Hasan, Ciurdariu Loredana   +2 more
doaj   +1 more source

Sufficiency and duality in multiobjective fractional programming problems involving generalized type I functions

Journal of Inequalities and Applications, 2013
In this paper, we establish sufficient optimality conditions for the (weak) efficiency to multiobjective fractional programming problems involving generalized (F,α,ρ,d)-V-type I functions. Using the optimality conditions, we also investigate a parametric-
Shun-Chin Ho
semanticscholar   +2 more sources

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

Coordinate shadows of semi-definite and Euclidean distance matrices [PDF]

, 2015
We consider the projected semi-definite and Euclidean distance cones onto a subset of the matrix entries. These two sets are precisely the input data defining feasible semi-definite and Euclidean distance completion problems.
Drusvyatskiy, D., Pataki, G., Wolkowicz, H.   +2 more
core   +3 more sources

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, D. Y. Gao, D. Y. Gao, D. Y. Gao, D. Y. Gao, D. Y. Gao, D. Y. Gao, D. Y. Gao, J. Gallier, J. S. Rowlinson, M. D. Voisei, M. D. Voisei, R. A. Horn, T. W. B. Kibble   +13 more
core   +1 more source

On generalized Fenchel-Moreau theorem and second-order characterization for convex vector functions

Fixed Point Theory and Applications, 2013
Based on the concept of conjugate and biconjugate maps introduced in (Tan and Tinh in Acta Math. Viet. 25:315-345, 2000) we establish a full generalization of the Fenchel-Moreau theorem for the vector case.
Phan Nhat Tinh, Do Sang Kim
semanticscholar   +2 more sources

A Note on the Convergence of ADMM for Linearly Constrained Convex Optimization Problems

, 2016
This note serves two purposes. Firstly, we construct a counterexample to show that the statement on the convergence of the alternating direction method of multipliers (ADMM) for solving linearly constrained convex optimization problems in a highly ...
Chen, Liang, Sun, Defeng, Toh, Kim-Chuan
core   +1 more source