Stefania Bellavia

Adaptive cubic regularization methods with dynamic inexact Hessian information and applications to finite-sum minimization

  • Stefania Bellavia
  • Benedetta Morini
  • Gianmarco Gurioli
    • Categories Unconstrained Optimization Tags

    Abstract. We consider the Adaptive Regularization with Cubics approach for solving nonconvex optimization problems and propose a new variant based on inexact Hessian information chosen dynamically. The theoretical analysis of the proposed procedure is given. The key property of ARC framework, constituted by optimal worst-case function/derivative evaluation bounds for first- and second-order critical point, is … Read more

    Inexact restoration with subsampled trust-region methods for finite-sum minimization

  • Stefania Bellavia
  • Nataša Krejić
  • Benedetta Morini
    • Categories Unconstrained Optimization Tags , , , ,

    Convex and nonconvex finite-sum minimization arises in many scientific computing and machine learning applications. Recently, first-order and second-order methods where objective functions, gradients and Hessians are approximated by randomly sampling components of the sum have received great attention. We propose a new trust-region method which employs suitable approximations of the objective function, gradient and Hessian … Read more

    Adaptive regularization algorithms with inexact evaluations for nonconvex optimization

  • Stefania Bellavia
  • Benedetta Morini
  • Philippe L. Toint
  • Gianmarco Gurioli
    • Categories Constrained Nonlinear Optimization, Data-Mining, Unconstrained Optimization Tags , , , ,

    A regularization algorithm using inexact function values and inexact derivatives is proposed and its evaluation complexity analyzed. This algorithm is applicable to unconstrained problems and to problems with inexpensive constraints (that is constraints whose evaluation and enforcement has negligible cost) under the assumption that the derivative of highest degree is beta-H\”{o}lder continuous. It features a … Read more

    Adaptive Cubic Regularization methods with dynamic inexact Hessian information and applications to finite-sum minimization

  • Stefania Bellavia
  • Benedetta Morini
  • Gianmarco Gurioli
    • Categories Unconstrained Optimization Tags

    We consider the Adaptive Regularization with Cubics approach for solving nonconvex optimization problems and propose a new variant based on inexact Hessian information chosen dynamically. The theoretical analysis of the proposed procedure is given. The key property of ARC framework, constituted by optimal worst-case function/derivative evaluation bounds for first- and second-order critical point, is guaranteed. … Read more

    Stable interior point method for convex quadratic programming with strict error bounds

  • Stefania Bellavia
  • Martin Neuenhofen
    • Categories Quadratic Programming Tags , , ,

    We present a short step interior point method for solving a class of nonlinear programming problems with quadratic objective function. Convex quadratic programming problems can be reformulated as problems in this class. The method is shown to have weak polynomial time complexity. A complete proof of the numerical stability of the method is provided. No … Read more

    On an Elliptical Trust-Region Procedure for Ill-Posed Nonlinear Least-Squares Problems

  • Stefania Bellavia
  • Elisa Riccietti
    • Categories Nonlinear Systems and Least-Squares Tags , , , ,

    In this paper we address the stable numerical solution of ill-posed nonlinear least-squares problems with small residual. We propose an elliptical trust-region reformulation of a Levenberg-Marquardt procedure. Thanks to an appropriate choice of the trust-region radius, the proposed procedure guarantees an automatic choice of the free regularization parameters that, together with a suitable stopping criterion, … Read more

    Subsampled Inexact Newton methods for minimizing large sums of convex functions

  • Stefania Bellavia
  • Nataša Krejić
  • Nataša Krklec Jerinkić
    • Categories Convex Optimization, Unconstrained Optimization Tags , , , ,

    This paper deals with the minimization of large sum of convex functions by Inexact Newton (IN) methods employing subsampled Hessian approximations. The Conjugate Gradient method is used to compute the inexact Newton step and global convergence is enforced by a nonmonotone line search procedure. The aim is to obtain methods with affordable costs and fast … Read more

    A Levenberg-Marquardt method for large nonlinear least-squares problems with dynamic accuracy in functions and gradients

  • Stefania Bellavia
  • Serge Gratton
  • Elisa Riccietti
    • Categories Nonlinear Optimization, Nonlinear Systems and Least-Squares Tags

    In this paper we consider large scale nonlinear least-squares problems for which function and gradient are evaluated with dynamic accuracy and propose a Levenberg-Marquardt method for solving such problems. More precisely, we consider the case in which the exact function to optimize is not available or its evaluation is computationally demanding, but ap- proximations of … Read more

    Sequential Linear Programming and Particle Swarm Optimization for the optimization of energy districts

  • Stefania Bellavia
  • Elisa Riccietti
  • Stefano Sello
    • Categories Basic Sciences Applications, Constrained Nonlinear Optimization, Nonlinear Optimization Tags , , ,

    In this paper we deal with the optimization of energy resources management of industrial districts, with the aim of minimizing the customer energy expenses. In a district the number of possible energy system combinations is really large, and a manual design approach might lead to a suboptimal solution. For this reason we designed a software … Read more

    An inexact dual logarithmic barrier method for solving sparse semidefinite programs

  • Stefania Bellavia
  • Jacek Gondzio
  • Margherita Porcelli
    • Categories Nonlinear Optimization, Semi-definite Programming

    A dual logarithmic barrier method for solving large, sparse semidefinite programs is proposed in this paper. The method avoids any explicit use of the primal variable X and therefore is well-suited to problems with a sparse dual matrix S. It relies on inexact Newton steps in dual space which are computed by the conjugate gradient … Read more