interior point methods

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

    Sparse Approximations with Interior Point Methods

  • Valentina De Simone
  • Daniela di Serafino
  • Jacek Gondzio
  • Spyridon Pougkakiotis
  • Marco Viola
    • Categories Applications - Science and Engineering, Convex and Nonsmooth Optimization, Nonlinear Optimization Tags , , , , , , ,

    Large-scale optimization problems that seek sparse solutions have become ubiquitous. They are routinely solved with various specialized first-order methods. Although such methods are often fast, they usually struggle with not-so-well conditioned problems. In this paper, specialized variants of an interior point-proximal method of multipliers are proposed and analyzed for problems of this class. Computational experience … Read more

    A structured modified Newton approach for solving systems of nonlinear equations arising in interior-point methods for quadratic programming

  • David Ek
  • Anders Forsgren
    • Categories Quadratic Programming Tags , , , ,

    The focus in this work is interior-point methods for quadratic optimization problems with linear inequality constraints where the system of nonlinear equations that arise are solved with Newton-like methods. In particular, the concern is the system of linear equations to be solved at each iteration. Newton systems give high quality solutions but there is an … Read more

    A geodesic interior-point method for linear optimization over symmetric cones

  • Frank Permenter
    • Categories Complementarity and Variational Inequalities, Convex Optimization, Linear, Cone and Semidefinite Programming Tags , ,

    We develop a new interior-point method (IPM) for symmetric-cone optimization, a common generalization of linear, second-order-cone, and semidefinite programming. In contrast to classical IPMs, we update iterates with a geodesic of the cone instead of the kernel of the linear constraints. This approach yields a primal-dual-symmetric, scale-invariant, and line-search-free algorithm that uses just half the … Read more

    Towards practical generic conic optimization

  • Chris Coey
  • Juan Pablo Vielma
  • Lea Kapelevich
    • Categories Convex Optimization, Linear, Cone and Semidefinite Programming, Optimization Software and Modeling Systems Tags , , ,

    Many convex optimization problems can be represented through conic extended formulations with auxiliary variables and constraints using only the small number of standard cones recognized by advanced conic solvers such as MOSEK 9. Such extended formulations are often significantly larger and more complex than equivalent conic natural formulations, which can use a much broader class … Read more

    A primal-dual interior-point relaxation method with adaptively updating barrier for nonlinear programs

  • Yu-Hong Dai
  • Yakui Huang
  • Xin-Wei Liu
    • Categories Nonlinear Optimization Tags , , , ,

    Based on solving an equivalent parametric equality constrained mini-max problem of the classic logarithmic-barrier subproblem, we present a novel primal-dual interior-point relaxation method for nonlinear programs. In the proposed method, the barrier parameter is updated in every step as done in interior-point methods for linear programs, which is prominently different from the existing interior-point methods … Read more

    Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization

  • David Ek
  • Anders Forsgren
    • Categories Bound-constrained Optimization Tags , , ,

    The focus in this paper is interior-point methods for bound-constrained nonlinear optimization where the system of nonlinear equations that arise are solved with Newton’s method. There is a trade-off between solving Newton systems directly, which give high quality solutions, and solving many approximate Newton systems which are computationally less expensive but give lower quality solutions. … Read more

    A New Preconditioning Approach for an Interior Point-Proximal Method of Multipliers for Linear and Convex Quadratic Programming

  • Luca Bergamaschi
  • Jacek Gondzio
  • John W. Pearson
  • Ángeles Martínez
  • Spyridon Pougkakiotis
    • Categories Convex Optimization, Linear Programming, Quadratic Programming Tags , , , ,

    In this paper, we address the efficient numerical solution of linear and quadratic programming problems, often of large scale. With this aim, we devise an infeasible interior point method, blended with the proximal method of multipliers, which in turn results in a primal-dual regularized interior point method. Application of this method gives rise to a … Read more

    Customized transition towards smart homes: A fast framework for economic analyses

  • Matheus Roberto Campos Chaves
  • Michael David de Souza Dutra
  • William de Paula Ferreira
  • Gerson da Conceição Júnior
    • Categories Applications - OR and Management Sciences, Energy Tags , , ,

    Smart homes allow the optimization of energy usage so that households can reduce electricity bills, or even make profits. By 2020, 20% of all households in Europe and 35% in North America will be expected to become smart homes. Although smart homes seem to be the future for homes, many customers have the perception that … Read more

    A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion

  • Stefania Bellavia
  • Jacek Gondzio
  • Margherita Porcelli
    • Categories Nonlinear Systems and Least-Squares, Semi-definite Programming Tags , , ,

    A new relaxed variant of interior point method for low-rank semidefinite programming problems is proposed in this paper. The method is a step outside of the usual interior point framework. In anticipation to converging to a low-rank primal solution, a special nearly low-rank form of all primal iterates is imposed. To accommodate such a (restrictive) … Read more