Forecasting conceivable interest rate market scenarios and significant losses on interest rate portfolios using mathematical optimization

  • Katsuhiro Tanaka
    • Categories Constrained Nonlinear Optimization, Finance and Economics Tags , , , , ,

    This study proposes a mathematical optimization programming model that simultaneously forecasts interest rate market scenarios and significant losses on interest rate market portfolios. The model includes three main components. A constraint condition is set using the Mahalanobis distance, which consists of innovation terms in a dynamic conditional correlation-generalized autoregressive conditional heteroscedasticity (DCC-GARCH) model that represent … Read more

    Coupled task scheduling with time-dependent processing times

  • Mostafa Khatami
  • Amir Salehipour
    • Categories Applications - OR and Management Sciences, Scheduling

    The single machine coupled task scheduling problem includes a set of jobs, each with two separated tasks and there is an exact delay between the tasks. We investigate the single machine coupled task scheduling problem with the objective of minimizing the makespan under identical processing time for the first task and identical delay period for … Read more

    Two-stage Stochastic Programming with Linearly Bi-parameterized Quadratic Recourse

  • Ying Cui
  • Junyi Liu
  • Jong-Shi Pang
  • Suvrajeet Sen
    • Categories Stochastic Programming Tags , ,

    This paper studies the class of two-stage stochastic programs (SP) with a linearly bi-parameterized recourse function defined by a convex quadratic program. A distinguishing feature of this new class of stochastic programs is that the objective function in the second stage is linearly parameterized by the first-stage decision variable, in addition to the standard linear … Read more

    Approximating L1-Norm Best-Fit Lines

  • J. Paul Brooks
  • JH Dulá
    • Categories Data-Mining

    Sufficient conditions are provided for a deterministic algorithm for estimating an L1-norm best-fit one-dimensional subspace. To prove the conditions are sufficient, fundamental properties of the L1-norm projection of a point onto a one-dimensional subspace are derived. Also, an equivalence is established between the algorithm, which involves the calculation of several weighted medians, and independently-derived algorithms … Read more

    A Geometrical Analysis of a Class of Nonconvex Conic Programs for Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems

  • Sunyoung Kim
  • Masakazu Kojima
  • Kim-Chuan Toh
    • Categories Linear, Cone and Semidefinite Programming Tags , , ,

    We present a geometrical analysis on the completely positive programming reformulation of quadratic optimization problems and its extension to polynomial optimization problems with a class of geometrically defined nonconvex conic programs and their covexification. The class of nonconvex conic programs is described with a linear objective function in a linear space $V$, and the constraint … Read more

    Algorithms for single- and multiple-runway Aircraft Landing Problem

  • Amir Salehipour
    • Categories Applications - OR and Management Sciences, Scheduling

    The Aircraft Landing Problem is the problem of allocating an airport’s runways to arriving aircraft as well as scheduling the landing time of aircraft, with the objective of minimizing total deviations from the target landing times. This work proposes new approaches to solve the Aircraft Landing Problem. The distinguishing factors of the proposed approaches include … Read more

    Local minimizers of semi-algebraic functions

  • Tiên-So'n Pham
    • Categories Nonsmooth Optimization, Unconstrained Optimization Tags , , , , , ,

    Consider a semi-algebraic function $f\colon\mathbb{R}^n \to {\mathbb{R}},$ which is continuous around a point $\bar{x} \in \mathbb{R}^n.$ Using the so–called {\em tangency variety} of $f$ at $\bar{x},$ we first provide necessary and sufficient conditions for $\bar{x}$ to be a local minimizer of $f,$ and then in the case where $\bar{x}$ is an isolated local minimizer of … Read more

    Intersection disjunctions for reverse convex sets

  • James R. Luedtke
  • Eli Towle
    • Categories (Mixed) Integer Nonlinear Programming, Constrained Nonlinear Optimization, Global Optimization Theory Tags , , , ,

    We present a framework to obtain valid inequalities for optimization problems constrained by a reverse convex set, which is defined as the set of points in a polyhedron that lie outside a given open convex set. We are particularly interested in cases where the closure of the convex set is either non-polyhedral, or is defined … Read more

    Distributionally Robust Optimization with Confidence Bands for Probability Density Functions

  • Xi Chen
  • Qihang Lin
  • Guanglin Xu
    • Categories Robust Optimization, Stochastic Programming

    Distributionally robust optimization (DRO) has been introduced for solving stochastic programs where the distribution of the random parameters is unknown and must be estimated by samples from that distribution. A key element of DRO is the construction of the ambiguity set, which is a set of distributions that covers the true distribution with a high … Read more

    Composite optimization for robust blind deconvolution

  • Vasileios Charisopoulos
  • Damek Davis
  • Mateo Díaz
  • Dmitriy Drusvyatskiy
    • Categories Convex and Nonsmooth Optimization Tags , , , , ,

    The blind deconvolution problem seeks to recover a pair of vectors from a set of rank one bilinear measurements. We consider a natural nonsmooth formulation of the problem and show that under standard statistical assumptions, its moduli of weak convexity, sharpness, and Lipschitz continuity are all dimension independent. This phenomenon persists even when up to … Read more