-
作者：Rosat, Samuel; Elhallaoui, Issmail; Soumis, Francois; Lodi, Andrea
作者单位：Universite de Montreal; Universite de Montreal; Polytechnique Montreal
摘要：This paper concentrates on the addition of cutting planes to the integral simplex using decomposition (ISUD) of Zaghrouti et al. (Oper Res 62(2):435-449, 2014). This method solves the set partitioning problem by iteratively improving an existing feasible solution. We present the algorithm in a primal language and relate it to existing augmenting methods. The resulting theoretical properties, stronger than the ones already known, simplify termination proofs and deepen the geometrical insights o...
-
作者：Modaresi, Sina; Vielma, Juan Pablo
作者单位：Pennsylvania Commonwealth System of Higher Education (PCSHE); University of Pittsburgh; Massachusetts Institute of Technology (MIT)
摘要：In this paper we consider an aggregation technique introduced by YA +/- ldA +/- ran (J Math Control Inf 26:417-450, 2009) to study the convex hull of regions defined by two quadratic inequalities or by a conic quadratic and a quadratic inequality. YA +/- ldA +/- ran (2009) shows how to characterize the convex hull of open sets defined by two strict quadratic inequalities using Linear Matrix Inequalities. We show how this aggregation technique can be easily extended to yield valid conic quadrat...
-
作者：Toriello, Alejandro; Uhan, Nelson A.
作者单位：University System of Georgia; Georgia Institute of Technology; United States Department of Defense; United States Navy; United States Naval Academy
摘要：Motivated by situations in which independent agents wish to cooperate in some uncertain endeavor over time, we study dynamic linear programming games, which generalize classical linear production games to multi-period settings under uncertainty. We specifically consider that players may have risk-averse attitudes towards uncertainty, and model this risk aversion using coherent conditional risk measures. For this setting, we study the strong sequential core, a natural extension of the core to d...
-
作者：Abada, Ibrahim; d'Aertrycke, Gauthier de Maere; Smeers, Yves
作者单位：Engie; Engie; Universite Catholique Louvain
摘要：Investment in generation capacity has traditionally been evaluated by computing the present value of cashflows accruing from new equipment in a market with globally optimized capacity mix. The competition and risk that now prevail in the sector may require a more refined analysis. We consider a competitive market with agents investing in some mix of capacities: the risk exposure of a plant and the attitude towards risk of the owner depend on the plant and the portfolio of its capacities. They ...
-
作者：Birgin, E. G.; Gardenghi, J. L.; Martinez, J. M.; Santos, S. A.; Toint, Ph. L.
作者单位：Universidade de Sao Paulo; Universidade Estadual de Campinas; University of Namur; University of Namur
摘要：The worst-case evaluation complexity for smooth (possibly nonconvex) unconstrained optimization is considered. It is shown that, if one is willing to use derivatives of the objective function up to order p (for p >= 1) and to assume Lipschitz continuity of the p-th derivative, then an epsilon-approximate first-order critical point can be computed in at most O(epsilon -((p+1)/p)) evaluations of the problem's objective function and its derivatives. This generalizes and subsumes results known for...
-
作者：Zhou, Zirui; So, Anthony Man-Cho
作者单位：Chinese University of Hong Kong
摘要：Error bounds, which refer to inequalities that bound the distance of vectors in a test set to a given set by a residual function, have proven to be extremely useful in analyzing the convergence rates of a host of iterative methods for solving optimization problems. In this paper, we present a new framework for establishing error bounds for a class of structured convex optimization problems, in which the objective function is the sum of a smooth convex function and a general closed proper conve...
-
作者：Consolini, Luca; Locatelli, Marco
作者单位：University of Parma
摘要：The complexity of quadratic programming problems with two quadratic constraints is an open problem. In this paper we show that when one constraint is a ball constraint and the Hessian of the quadratic function defining the other constraint is positive definite, then, under quite general conditions, the problem can be solved in polynomial time in the real-number model of computation through an approach based on the analysis of the dual space of the Lagrange multipliers. However, the degree of t...
-
作者：Schmidt, Mark; Le Roux, Nicolas; Bach, Francis
作者单位：University of British Columbia
-
作者：Firsching, Moritz
作者单位：Free University of Berlin
摘要：We show that nonlinear optimization techniques can successfully be applied to realize and to inscribe matroid polytopes and simplicial spheres. In order to show non-realizability of simplicial spheres, we extend the method of finding biquadratic final polynomials for matroid polytopes to partial matroid polytopes. Combining these two methods we obtain a complete classification of neighborly polytopes of dimension 4, 6 and 7 with 11 vertices, of neighborly 5-polytopes with 10 vertices, as well ...
-
作者：Timoshin, Sergey A.
作者单位：Irkutsk Science Centre of the Russian Academy of Sciences; Russian Academy of Sciences; Matrosov Institute for System Dynamics & Control Theory SB RAS
摘要：We consider a differential inclusion of subdifferential type with a nonconvex and unbounded valued perturbation. Existence and relaxation results are obtained for this inclusion. By relaxation we mean approximation of a solution of the differential inclusion with convexified perturbation by solutions of the given inclusion. The traditional condition of Lipschitz continuity for such kind of problems is weakened and a somehow more appropriate in the context of unbounded valued multifunctions tru...
