Results 31 to 40 of about 1,574 (145)
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
Presolving linear bilevel optimization problems
EURO Journal on Computational Optimization, 2021 Linear bilevel optimization problems are known to be strongly NP-hard and the computational techniques to solve these problems are often motivated by techniques from single-level mixed-integer optimization.
Thomas Kleinert +3 more
doaj +1 more source
Positive Definiteness and Semi-Definiteness of Even Order Symmetric Cauchy Tensors [PDF]
, 2014 Motivated by symmetric Cauchy matrices, we define symmetric Cauchy tensors and their generating vectors in this paper. Hilbert tensors are symmetric Cauchy tensors.
Chen, Haibin, Qi, Liqun
core +1 more source
International Journal of Stochastic Analysis, Volume 2004, Issue 3, Page 235-244, 2004., 2004 We consider a new class of equilibrium problems, known as hemiequilibrium problems. Using the auxiliary principle technique, we suggest and analyze a class of iterative algorithms for solving hemiequilibrium problems, the convergence of which requires either pseudomonotonicity or partially relaxed strong monotonicity. As a special case, we obtain a new
Muhammad Aslam Noor
wiley +1 more source
Optimizing condition numbers [PDF]
, 2009 In this paper we study the problem of minimizing condition numbers over a compact convex subset of the cone of symmetric positive semidefinite $n\times n$ matrices. We show that the condition number is a Clarke regular strongly pseudoconvex function.
Jane J. Ye, Lewis A.S., Pierre Maréchal
core +1 more source
Journal of Applied Mathematics, Volume 2004, Issue 5, Page 409-431, 2004., 2004 We consider the problem of projecting a point onto a region defined by a linear equality or inequality constraint and two‐sided bounds on the variables. Such problems are interesting because they arise in various practical problems and as subproblems of gradient‐type methods for constrained optimization.
Stefan M. Stefanov
wiley +1 more source
Existence of solutions of minimization problems with an increasing cost function and porosity
Abstract and Applied Analysis, Volume 2003, Issue 11, Page 651-670, 2003., 2003 We consider the minimization problem f(x) → min, x ∈ K, where K is a closed subset of an ordered Banach space X and f belongs to a space of increasing lower semicontinuous functions on K. In our previous work, we showed that the complement of the set of all functions f, for which the corresponding minimization problem has a solution, is of the first ...
Alexander J. Zaslavski
wiley +1 more source
Joint location and pricing within a user-optimized environment
EURO Journal on Computational Optimization, 2020 In the design of service facilities, whenever the behaviour of customers is impacted by queueing or congestion, the resulting equilibrium cannot be ignored by a firm that strives to maximize revenue within a competitive environment.
Teodora Dan +2 more
doaj +1 more source
On generalized derivatives for C1,1 vector optimization problems
Journal of Applied Mathematics, Volume 2003, Issue 7, Page 365-376, 2003., 2003 We introduce generalized definitions of Peano and Riemann directional derivatives in order to obtain second‐order optimality conditions for vector optimization problems involving C1,1 data. We show that these conditions are stronger than those in literature obtained by means of second‐order Clarke subdifferential.
Davide La Torre
wiley +1 more source
Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere [PDF]
, 2019 We study the convergence rate of a hierarchy of upper bounds for polynomial minimization problems, proposed by Lasserre [SIAM J. Optim. 21(3) (2011), pp. 864-885], for the special case when the feasible set is the unit (hyper)sphere.
de Klerk, Etienne, Laurent, Monique
core +2 more sources