activity
20172021
most citedNaive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming

4 citations · 11 across the 5 of their papers we have counts for

collaborators

5 papers

math.OC20212 cited

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

Roberto Andreani, Gabriel Haeser, Leonardo M. Mito +2

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 c…

math.OC20214 cited

Sequential constant rank constraint qualifications for nonlinear semidefinite programming with applications

Roberto Andreani, Gabriel Haeser, Leonardo M. Mito +1

We present new constraint qualification conditions for nonlinear semidefinite programming that extend some of the constant rank-type conditions from nonlinear programming. As an ap…

math.OC20204 cited

Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming

R. Andreani, G. Haeser, L. M. Mito +3

The constant rank constraint qualification, introduced by Janin in 1984 for nonlinear programming, has been extensively used for sensitivity analysis, global convergence of first-…

math.OC2017

On a conjecture in second-order optimality conditions

R. Behling, G. Haeser, A. Ramos +1

In this paper we deal with optimality conditions that can be verified by a nonlinear optimization algorithm, where only a single Lagrange multiplier is avaliable. In particular, we…

cs.CC20171 cited

Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary

Gabriel Haeser, Hongcheng Liu, Yinyu Ye

In this paper we consider the minimization of a continuous function that is potentially not differentiable or not twice differentiable on the boundary of the feasible region. By ex…