Results 21 to 30 of about 1,105 (105)
A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization
EURO Journal on Computational Optimization, 2021 Bilevel optimization is a field of mathematical programming in which some variables are constrained to be the solution of another optimization problem. As a consequence, bilevel optimization is able to model hierarchical decision processes.
Thomas Kleinert +3 more
doaj +1 more source
Radii minimal projections of polytopes and constrained optimization of symmetric polynomials [PDF]
, 2005 We provide a characterization of the radii minimal projections of polytopes onto $j$-dimensional subspaces in Euclidean space $\E^n$. Applied on simplices this characterization allows to reduce the computation of an outer radius to a computation in the ...
Brandenberg, Rene, Theobald, Thorsten
core +4 more sources
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
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
About the Algebraic Solutions of Smallest Enclosing Cylinders Problems [PDF]
, 2011 Given n points in Euclidean space E^d, we propose an algebraic algorithm to compute the best fitting (d-1)-cylinder. This algorithm computes the unknown direction of the axis of the cylinder.
E. Schömer +11 more
core +1 more source
Alternative SDP and SOCP approximations for polynomial optimization
EURO Journal on Computational Optimization, 2019 In theory, hierarchies of semidefinite programming (SDP) relaxations based on sum of squares (SOS) polynomials have been shown to provide arbitrarily close approximations for a general polynomial optimization problem (POP).
Xiaolong Kuang +3 more
doaj +1 more source
EURO Journal on Computational Optimization, 2020 The concept of leader-follower (or Stackelberg) equilibrium plays a central role in a number of real-world applications bordering on mathematical optimization and game theory.
Nicola Basilico +3 more
doaj +1 more source
A bounded degree SOS hierarchy for polynomial optimization
EURO Journal on Computational Optimization, 2017 We consider a new hierarchy of semidefinite relaxations for the general polynomial optimization problem (P):f∗=min{f(x):x∈K} on a compact basic semi-algebraic set K⊂Rn.
JeanB. Lasserre +2 more
doaj +1 more source
Global Behavior of the Douglas-Rachford Method for a Nonconvex Feasibility Problem [PDF]
, 2015 In recent times the Douglas-Rachford algorithm has been observed empirically to solve a variety of nonconvex feasibility problems including those of a combinatorial nature.
Artacho, Francisco J. Aragón +2 more
core +3 more sources
A parametric linearizing approach for quadratically inequality constrained quadratic programs
Open Mathematics, 2018 In this paper we propose a new parametric linearizing approach for globally solving quadratically inequality constrained quadratic programs. By utilizing this approach, we can derive the parametric linear programs relaxation problem of the investigated ...
Jiao Hongwei, Chen Rongjiang
doaj +1 more source