Infinite Dimensional Optimization

Semi-Infinite Generalized Disjunctive and Mixed Integer Convex Programs with(out) Uncertainty

  • Manish Bansal
    • Categories 0-1 Programming, Convex Optimization, Semi-infinite Programming

    In this paper, we introduce semi-infinite generalized disjunctive programs that are defined by logical propositions along with disjunctions of sets of logical equations and infinite number of algebraic inequalities. We denote these programs by SIGDPs. For SIGDPs with linear and convex inequalities, we present new reformulations: semi-infinite mixed-binary/disjunctive linear programs and semi-infinite mixed-binary/disjunctive convex programs, … Read more

    Gas Transport Network Optimization: PDE-Constrained Models

  • Falk M. Hante
  • Martin Schmidt
    • Categories Applications - Science and Engineering, Infinite Dimensional Optimization, Systems governed by Differential Equations Optimization Tags , , , ,

    The optimal control of gas transport networks was and still is a very important topic for modern economies and societies. Accordingly, a lot of research has been carried out on this topic during the last years and decades. Besides mixed-integer aspects in gas transport network optimization, one of the main challenges is that a physically … Read more

    Duality in convex stochastic optimization

  • Teemu Pennanen
  • Ari-Pekka Perkkiö
    • Categories Convex Optimization, Infinite Dimensional Optimization, Stochastic Programming Tags , , ,

    This paper studies duality and optimality conditions in general convex stochastic optimization problems introduced by Rockafellar and Wets in \cite{rw76}. We derive an explicit dual problem in terms of two dual variables, one of which is the shadow price of information while the other one gives the marginal cost of a perturbation much like in … Read more

    Semi-infinite models for equilibrium selection

  • Maren Beck
  • Oliver Stein
    • Categories Game Theory, Multi-Criteria Optimization, Semi-infinite Programming Tags , , , ,

    In their seminal work `A General Theory of Equilibrium Selection in Games’ (The MIT Press, 1988) Harsanyi and Selten introduce the notion of payoff dominance to explain how players select some solution of a Nash equilibrium problem from a set of nonunique equilibria. We formulate this concept for generalized Nash equilibrium problems, relax payoff dominance … Read more

    Optimal Robust Policy for Feature-Based Newsvendor

  • Luhao Zhang
  • Jincheng Yang
  • Rui Gao
    • Categories Infinite Dimensional Optimization, Robust Optimization, Supply Chain Management Tags , , ,

    We study policy optimization for the feature-based newsvendor, which seeks an end-to-end policy that renders an explicit mapping from features to ordering decisions. Unlike existing works that restrict the policies to some parametric class which may suffer from sub-optimality (such as affine class) or lack of interpretability (such as neural networks), we aim to optimize … Read more

    A Stochastic Bregman Primal-Dual Splitting Algorithm for Composite Optimization

  • Antonio Silveti-Falls
  • Cesare Molinari
  • Jalal Fadili
    • Categories Convex and Nonsmooth Optimization, Infinite Dimensional Optimization, Stochastic Programming Tags , , , , , , , ,

    We study a stochastic first order primal-dual method for solving convex-concave saddle point problems over real reflexive Banach spaces using Bregman divergences and relative smoothness assumptions, in which we allow for stochastic error in the computation of gradient terms within the algorithm. We show ergodic convergence in expectation of the Lagrangian optimality gap with a … Read more

    On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization

  • Baha Alzalg
  • Amira Achouak Oulha
    • Categories Linear, Cone and Semidefinite Programming, Robust Optimization, Semi-infinite Programming Tags , , , ,

    We present approximate solutions for the robust semi-infinite multi-objective convex symmetric cone programming problem. By using the robust optimization approach, we establish an approximate optimality theorem and approximate duality theorems for approximate solutions in convex symmetric cone optimization problem involving infinitely many constraints to be satisfied and multiple objectives to be optimized simultaneously under the … Read more

    Sinkhorn Distributionally Robust Optimization

  • Jie Wang
  • Rui Gao
  • Yao Xie
    • Categories Infinite Dimensional Optimization, Robust Optimization, Stochastic Programming

    We study distributionally robust optimization (DRO) with Sinkhorn distance—a variant of Wasserstein distance based on entropic regularization. We derive convex programming dual reformulation for general nominal distributions, transport costs, and loss functions. Compared with Wasserstein DRO, our proposed approach offers enhanced computational tractability for a broader class of loss functions, and the worst-case distribution exhibits … Read more

    Barrier Methods Based on Jordan-Hilbert Algebras for Stochastic Optimization in Spin Factors

  • Baha Alzalg
    • Categories Infinite Dimensional Optimization, Linear, Cone and Semidefinite Programming, Stochastic Programming Tags , , , , ,

    We present decomposition logarithmic-barrier interior-point methods based on unital Jordan-Hilbert algebras for infinite-dimensional stochastic second-order cone programming problems in spin factors. The results show that the iteration complexity of the proposed algorithms is independent on the choice of Hilbert spaces from which the underlying spin factors are formed, and so it coincides with the best … Read more

    Different discretization techniques for solving optimal control problems with control complementarity constraints

  • Yu Deng
    • Categories Complementarity and Variational Inequalities, Infinite Dimensional Optimization Tags , , , ,

    There are first-optimize-then-discretize (indirect) and first-discretize-then-optimize (direct) methods to deal with infinite dimensional optimal problems numerically by use of finite element methods. Generally, both discretization techniques lead to different structures. Regarding the indirect method, one derives optimality conditions of the considered infinite dimensional problems in appropriate function spaces firstly and then discretizes them into suitable … Read more