Applications – Science and Engineering

High-Order Evaluation Complexity for Convexly-Constrained Optimization with Non-Lipschitzian Group Sparsity Terms

  • Xiaojun Chen
  • Philippe L. Toint
    • Categories Constrained Nonlinear Optimization, Data-Mining, Statistics Tags , , , , ,

    This paper studies high-order evaluation complexity for partially separable convexly-constrained optimization involving non-Lipschitzian group sparsity terms in a nonconvex objective function. We propose a partially separable adaptive regularization algorithm using a $p$-th order Taylor model and show that the algorithm can produce an (epsilon,delta)-approximate q-th-order stationary point in at most O(epsilon^{-(p+1)/(p-q+1)}) evaluations of the objective … Read more

    A Framework for Peak Shaving Through the Coordination of Smart Homes

  • Miguel F. Anjos
  • Michael David de Souza Dutra
  • Sébastien Le Digabel
    • Categories (Mixed) Integer Linear Programming, Energy, Scheduling

    In demand–response programs, aggregators balance the needs of generation companies and end-users. This work proposes a two-phase framework that shaves the aggregated peak loads while maintaining the desired comfort level for users. In the first phase, the users determine their planned consumption. For the second phase, we develop a bilevel model with mixed-integer variables and … Read more

    Recovery of a mixture of Gaussians by sum-of-norms clustering

  • Tao Jiang
  • Stephen A. Vavasis
  • Chen Wen Zhai
    • Categories Second-Order Cone Programming, Statistics

    Sum-of-norms clustering is a method for assigning $n$ points in $\R^d$ to $K$ clusters, $1\le K\le n$, using convex optimization. Recently, Panahi et al.\ proved that sum-of-norms clustering is guaranteed to recover a mixture of Gaussians under the restriction that the number of samples is not too large. The purpose of this note is to … Read more

    Optimal Residential Battery Storage Operations Using Robust Data-driven Dynamic Programming

  • Grani A. Hanasusanto
  • Benjamin Leibowicz
  • Nan Zhang
    • Categories Applications - Science and Engineering Tags , , , , ,

    In this paper, we consider the problem of operating a battery storage unit in a home with a rooftop solar photovoltaic (PV) system so as to minimize expected long-run electricity costs under uncertain electricity usage, PV generation, and electricity prices. Solving this dynamic program using standard techniques is computationally burdensome, and is often complicated by … Read more

    A scalable mixed-integer decomposition approach for optimal power system restoration

  • Ignacio Aravena
  • Shmuel Oren
  • Deepak Rajan
  • Georgios Patsakis
  • Jennifer Rios
    • Categories (Mixed) Integer Linear Programming, Branch and Cut Algorithms, Energy Tags , , ,

    The optimal restoration problem lies at the foundation of the evaluation and improvement of resilience in power systems. In this paper we present a scalable decomposition algorithm, based on the integer L-shaped method, for solving this problem for realistic power systems. The algorithm works by partitioning the problem into a master problem and a slave … Read more

    Non-asymptotic Results for Langevin Monte Carlo: Coordinate-wise and Black-box Sampling

  • Krishnakumar Balasubramanian
  • Saeed Ghadimi
  • Lingqing Shen
    • Categories Nonlinear Optimization, Statistics Tags , , ,

    Euler-Maruyama and Ozaki discretization of a continuous time diffusion process is a popular technique for sampling, that uses (upto) gradient and Hessian information of the density respectively. The Euler-Maruyama discretization has been used particularly for sampling under the name of Langevin Monte Carlo (LMC) for sampling from strongly log-concave densities. In this work, we make … Read more

    A study of rank-one sets with linear side constraints and application to the pooling problem

  • Santanu S. Dey
  • Burak Kocuk
  • Asteroide Santana
    • Categories Applications - Science and Engineering, Global Optimization

    We study sets defined as the intersection of a rank-1 constraint with different choices of linear side constraints. We identify different conditions on the linear side constraints, under which the convex hull of the rank-1 set is polyhedral or second-order cone representable. In all these cases, we also show that a linear objective can be … Read more

    Rank-one Convexification for Sparse Regression

  • Alper Atamturk
  • Andrés Gómez
    • Categories (Mixed) Integer Nonlinear Programming, Semi-definite Programming, Statistics Tags , , , , ,

    Sparse regression models are increasingly prevalent due to their ease of interpretability and superior out-of-sample performance. However, the exact model of sparse regression with an L0 constraint restricting the support of the estimators is a challenging non-convex optimization problem. In this paper, we derive new strong convex relaxations for sparse regression. These relaxations are based … Read more

    A general framework for customized transition to smart homes

  • Miguel F. Anjos
  • Michael David de Souza Dutra
  • Sébastien Le Digabel
    • Categories Energy Tags , , ,

    Smart homes have the potential to achieve efficient energy consumption: households can profit from appropriately scheduled consumption. By 2020, 35% of all households in North America and 20% in Europe are expected to become smart homes. Developing a smart home requires considerable investment, and the householders expect a positive return. In this context, we address … Read more

    Fast Robust Methods for Singular State-Space Models

  • Aleksandr Y. Aravkin
  • James V. Burke
  • Sarah Webster
  • Jonathan Jonker
  • Gianluigi Pillonetto
    • Categories Control Applications, Nonsmooth Optimization, Statistics Tags , ,

    State-space models are used in a wide range of time series analysis applications. Kalman filtering and smoothing are work-horse algorithms in these settings. While classic algorithms assume Gaussian errors to simplify estimation, recent advances use a broad range of optimization formulations to allow outlier-robust estimation, as well as constraints to capture prior information. Here we … Read more