Gabriel Haeser

On achieving strong necessary second-order properties in nonlinear programming

  • Gabriel Haeser
  • Andreas Fischer
  • Thiago P. Silveira
    • Categories Nonlinear Optimization

    Second-order necessary or sufficient optimality conditions for nonlinear programming are usually defined by means of the positive (semi-)definiteness of a quadratic form, or a maximum of quadratic forms, over the critical cone. However, algorithms for finding such second-order stationary points are currently unknown. Typically, an algorithm with a second-order property approximates a primal-dual point such … Read more

    Constraint qualifications and strong global convergence properties of an augmented Lagrangian method on Riemannian manifolds

  • Roberto Andreani
  • Kelvin Rodrigues Couto
  • Orizon Pereira Ferreira
  • Gabriel Haeser
    • Categories Constrained Nonlinear Optimization, Nonlinear Optimization Tags , , ,

    In the past years, augmented Lagrangian methods have been successfully applied to several classes of non-convex optimization problems, inspiring new developments in both theory and practice. In this paper we bring most of these recent developments from nonlinear programming to the context of optimization on Riemannian manifolds, including equality and inequality constraints. Many research have … Read more

    A minimal face constant rank constraint qualification for reducible conic programming

  • Roberto Andreani
  • Gabriel Haeser
  • leomakoto
  • Héctor Ramírez
    • Categories Cone Programming, Linear, Cone and Semidefinite Programming, Nonlinear Optimization Tags , , , ,

    In a previous paper [R. Andreani, G. Haeser, L. M. Mito, H. Ramírez, T. P. Silveira. First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition. Mathematical Programming, 2023. DOI: 10.1007/s10107-023-01942-8] we introduced a constant rank constraint qualification for nonlinear semidefinite and second-order cone programming by considering all faces … Read more

    On the paper “Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem”

  • Luís Felipe Bueno
  • Gabriel Haeser
  • Oliver Kolossoski
    • Categories Nonlinear Optimization Tags , ,

    In the paper [Torrealba, E.M.R. et al. Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem. EJOR, 299(1) 46–59, 2021] an augmented Lagrangian algorithm was proposed for resource allocation problems with the intriguing characteristic that instead of solving the box-constrained augmented Lagrangian subproblem, they propose projecting the solution of the unconstrained subproblem onto … Read more

    Optimization of the first Dirichlet Laplacian eigenvalue with respect to a union of balls

  • Ernesto G. Birgin
  • Lucas Fernandez
  • Gabriel Haeser
  • Antoine
    • Categories Nonlinear Optimization, Optimization of Systems modeled by PDEs Tags , ,

    The problem of minimizing the first eigenvalue of the Dirichlet Laplacian with respect to a union of m balls with fixed identical radii and variable centers in the plane is investigated in the present work. The existence of a minimizer is shown and the shape sensitivity analysis of the eigenvalue with respect to the centers’ … Read more

    A Jacobi-type Newton method for Nash equilibrium problems with descent guarantees

  • Luís Felipe Bueno
  • Gabriel Haeser
  • Oliver Kolossoski
    • Categories Game Theory, Other Topics Tags , , , , ,

    A common strategy for solving an unconstrained two-player Nash equilibrium problem with continuous variables is applying Newton’s method to the system of nonlinear equations obtained by the corresponding first-order necessary optimality conditions. However, when taking into account the game dynamics, it is not clear what is the goal of each player when considering that they … Read more

    On the convergence of iterative schemes for solving a piecewise linear system of equations

  • Nicolas F. Armijo
  • Yunier Bello-Cruz
  • Gabriel Haeser
    • Categories Nonlinear Systems and Least-Squares Tags , ,

    This paper is devoted to studying the global and finite convergence of the semi-smooth Newton method for solving a piecewise linear system that arises in cone-constrained quadratic programming problems and absolute value equations. We first provide a negative answer via a counterexample to a conjecture on the global and finite convergence of the Newton iteration … Read more

    Global Convergence of Algorithms Under Constant Rank Conditions for Nonlinear Second-Order Cone Programming

  • Roberto Andreani
  • Gabriel Haeser
  • Leonardo M. Mito
  • Héctor Ramírez
  • Thiago P. Silveira
    • Categories Constrained Nonlinear Optimization, Second-Order Cone Programming Tags , , , ,

    In [R. Andreani, G. Haeser, L. M. Mito, H. Ramírez C., Weak notions of nondegeneracy in nonlinear semidefinite programming, arXiv:2012.14810, 2020] the classical notion of nondegeneracy (or transversality) and Robinson’s constraint qualification have been revisited in the context of nonlinear semidefinite programming exploiting the structure of the problem, namely, its eigendecomposition. This allows formulating the … Read more

    First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition

  • Roberto Andreani
  • Gabriel Haeser
  • Héctor Ramírez
  • Leonardo M. Mito
  • Thiago P. Siqueira
    • Categories Constrained Nonlinear Optimization, Second-Order Cone Programming, Semi-definite Programming

    The well known constant rank constraint qualification [Math. Program. Study 21:110–126, 1984] introduced by Janin for nonlinear programming has been recently extended to a conic context by exploiting the eigenvector structure of the problem. In this paper we propose a more general and geometric approach for defining a new extension of this condition to the … Read more

    Sequential constant rank constraint qualifications for nonlinear semidefinite programming with applications

  • Roberto Andreani
  • Gabriel Haeser
  • Héctor Ramírez
  • Leonardo M. Mito
    • Categories Constrained Nonlinear Optimization, Second-Order Cone Programming, Semi-definite Programming Tags , , ,

    We present new constraint qualification conditions for nonlinear semidefinite programming that extend some of the constant rank-type conditions from nonlinear programming. As an application of these conditions, we provide a unified global convergence proof of a class of algorithms to stationary points without assuming neither uniqueness of the Lagrange multiplier nor boundedness of the Lagrange … Read more