Roberto Andreani
YOU?
Author Swipe
Technosol made with urban and industrial waste: Potential for improving soil quality and growing tree seedlings Open
This study evaluated the use of waste materials to produce Technosol, a "tailor-made" soil consisting of construction and demolition waste (CDW), solid waste from stone mining (WSM), natural soil (NS), and compost from plant pruning (CPP),…
Constraint qualifications and strong global convergence properties of an augmented Lagrangian method on Riemannian manifolds Open
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 deve…
A minimal face constant rank constraint qualification for reducible conic programming Open
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…
View article: PHYSICAL-CHEMICAL AND MICROBIAL QUALITY OF THE “CERVEJA CASEIRA” (HOMEBREWED BEER) OF GUARAPUAVA/STATE OF PARANÁ – BRAZIL
PHYSICAL-CHEMICAL AND MICROBIAL QUALITY OF THE “CERVEJA CASEIRA” (HOMEBREWED BEER) OF GUARAPUAVA/STATE OF PARANÁ – BRAZIL Open
“Cerveja caseira” is a homebrewed beer sold in the Guarapuava municipality (State of Paraná, Southern Brazil). It was introduced by Slavic immigrants and adapted to Brazilian ingredients, being much appreciated in the region and disseminat…
Convergence of quasi-Newton methods for solving constrained generalized equations Open
In this paper, we focus on quasi-Newton methods to solve constrained generalized equations. As is well-known, this problem was firstly studied by Robinson and Josephy in the 70’s. Since then, it has been extensively studied by many other r…
Global Convergence of Algorithms Under Constant Rank Conditions for Nonlinear Second-Order Cone Programming Open
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 qualifi…
First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition Open
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 probl…
Sequential constant rank constraint qualifications for nonlinear semidefinite and second-order cone programming with applications Open
We present new constraint qualification conditions for nonlinear semidefinite and second-order cone programming that extend some of the constant rank-type conditions from nonlinear programming. As an application of these conditions, we pro…
Sequential constant rank constraint qualifications for nonlinear semidefinite programming with applications Open
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 …
Weak notions of nondegeneracy in nonlinear semidefinite programming Open
The constraint nondegeneracy condition is one of the most relevant and useful constraint qualifications in nonlinear semidefinite programming. It can be characterized in terms of any fixed orthonormal basis of the, let us say, $\ell$-dimen…
An assessment of Direct MultiSearch when enriched with first-order information for multiobjective optimization Open
Direct MultiSearch (DMS) is a robust and efficient derivative-free optimization algorithm, able to generate approximations to the complete Pareto front of a given multiobjective optimization (MOO) problem. When first (or higher) order deri…
On complexity and convergence of high-order coordinate descent algorithms Open
Coordinate descent methods with high-order regularized models for box-constrained minimization are introduced. High-order stationarity asymptotic convergence and first-order stationarity worst-case evaluation complexity bounds are establis…
On constant rank constraint qualifications for second-order cone programming Open
The constant rank constraint qualification introduced by Janin in 1984 for nonlinear programming has been extensively used for sensitivity analysis, global convergence of first- and second-order algorithms, and for computing the derivative…
Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming Open
The constant rank constraint qualification, introduced by Janin in 1984 for nonlinear programming, has been extensively used for sensitivity analysis, global convergence of first- and second-order algorithms, and for computing the derivati…
A weak maximum principle for optimal control problems with mixed constraints under a constant rank condition Open
Necessary optimality conditions for optimal control problems with mixed state-control equality constraints are obtained. The necessary conditions are given in the form of a weak maximum principle and are obtained under (i) a new regularity…
A Sequential Optimality Condition Related to the Quasi-normality Constraint Qualification and Its Algorithmic Consequences Open
In the present paper, we prove that the augmented Lagrangian method converges to KKT points under the quasi-normality constraint qualification, which is associated with the external penalty theory. An interesting consequence is that the La…
New Sequential Optimality Conditions for Mathematical Programs with Complementarity Constraints and Algorithmic Consequences Open
In recent years, the theoretical convergence of iterative methods for solving nonlinear constrained optimization problems has been addressed using sequential optimality conditions, which are satisfied by minimizers independently of constra…
A note on the convergence of an augmented Lagrangian algorithm to second-order stationary points Open
Many algorithms that ensure second-order necessary optimality conditions were developed in the literature. To the best of our knownledge, none of them guarantee Strong Second-Order Necessary Condition (SSONC). Gould and Toint [5] showed th…
Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization Open
Sequential optimality conditions for constrained optimization are necessarily satisfied by local minimizers, independently of the fulfillment of constraint qualifications. These conditions support the employment of different stopping crite…
On second-order optimality conditions in nonlinear optimization Open
In this work we present new weak conditions that ensure the validity of necessary second-order optimality conditions (SOC) for nonlinear optimization. We are able to prove that weak and strong SOCs hold for all Lagrange multipliers using A…
A Cone-Continuity Constraint Qualification and Algorithmic Consequences Open
Every local minimizer of a smooth constrained optimization problem satisfies the sequential approximate Karush--Kuhn--Tucker (AKKT) condition. This optimality condition is used to define the stopping criteria of many practical nonlinear pr…