default search action
Roberto Andreani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j51]Roberto Andreani, Ellen H. Fukuda, Gabriel Haeser
, Daiana O. Santos, Leonardo D. Secchin
Optimality Conditions for Nonlinear Second-Order Cone Programming and Symmetric Cone Programming. J. Optim. Theory Appl. 200(1): 1-33 (2024) - [j50]Roberto Andreani, John Frank Matos Ascona, Valeriano Antunes de Oliveira
A Weak Maximum Principle for Discrete Optimal Control Problems with Mixed Constraints. J. Optim. Theory Appl. 203(1): 562-599 (2024) - [j49]Roberto Andreani, Gabriel Haeser, Leonardo M. Mito
Weak notions of nondegeneracy in nonlinear semidefinite programming. Math. Program. 205(1): 1-32 (2024) - [j48]Roberto Andreani, María Laura Schuverdt, Leonardo D. Secchin
On Enhanced KKT Optimality Conditions for Smooth Nonlinear Optimization. SIAM J. Optim. 34(2): 1515-1539 (2024) - [j47]Roberto Andreani
Constraint Qualifications and Strong Global Convergence Properties of an Augmented Lagrangian Method on Riemannian Manifolds. SIAM J. Optim. 34(2): 1799-1825 (2024) - [j46]Roberto Andreani
Improving the Global Convergence of Inexact Restoration Methods for Constrained Optimization Problems. SIAM J. Optim. 34(4): 3429-3455 (2024) - 2023
- [j45]Roberto Andreani, Gabriel Haeser
First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition. Math. Program. 202(1): 473-513 (2023) - 2022
- [j44]Roberto Andreani
An extended delayed weighted gradient algorithm for solving strongly convex optimization problems. J. Comput. Appl. Math. 416: 114525 (2022) - [j43]V. S. Amaral, Roberto Andreani, Ernesto G. Birgin
On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization. J. Glob. Optim. 84(3): 527-561 (2022) - [j42]Roberto Andreani, Gabriel Haeser, Leonardo M. Mito
Global Convergence of Algorithms Under Constant Rank Conditions for Nonlinear Second-Order Cone Programming. J. Optim. Theory Appl. 195(1): 42-78 (2022) - [j41]Roberto Andreani
On Optimality Conditions for Nonlinear Conic Programming. Math. Oper. Res. 47(3): 2160-2185 (2022) - [j40]Roberto Andreani, Gabriel Haeser, María Laura Schuverdt, Leonardo D. Secchin
On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees. Math. Program. Comput. 14(1): 121-146 (2022) - [j39]Roberto Andreani
On the best achievable quality of limit points of augmented Lagrangian schemes. Numer. Algorithms 90(2): 851-877 (2022) - [j38]Roberto Andreani, Gabriel Haeser, Leonardo M. Mito, Alberto Ramos
Correction to: On the best achievable quality of limit points of augmented Lagrangian schemes. Numer. Algorithms 90(2): 879-880 (2022) - [j37]Harry Oviedo
A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization. Numer. Algorithms 90(3): 1225-1252 (2022) - [j36]Roberto Andreani, Gabriel Haeser
Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming. Optim. Lett. 16(2): 589-610 (2022) - [j35]Roberto Andreani, Ana Luísa Custódio, Marcos Raydan:
Using first-order information in direct multisearch for multiobjective optimization. Optim. Methods Softw. 37(6): 2135-2156 (2022) - 2021
- [j34]Roberto Andreani, Marcos Raydan
Properties of the delayed weighted gradient method. Comput. Optim. Appl. 78(1): 167-180 (2021) - [j33]Roberto Andreani, Ellen Hidemi Fukuda, Gabriel Haeser
On the use of Jordan Algebras for improving global convergence of an Augmented Lagrangian method in nonlinear semidefinite programming. Comput. Optim. Appl. 79(3): 633-648 (2021) - 2020
- [j32]Roberto Andreani, Valeriano Antunes de Oliveira
A weak maximum principle for optimal control problems with mixed constraints under a constant rank condition. IMA J. Math. Control. Inf. 37(3): 1021-1047 (2020) - [j31]Roberto Andreani, Gabriel Haeser
Optimality conditions and global convergence for nonlinear semidefinite programming. Math. Program. 180(1): 203-235 (2020)
2010 – 2019
- 2019
- [j30]Roberto Andreani, Viviana A. Ramirez, Sandra A. Santos
Bilevel optimization with a multiobjective problem in the lower level. Numer. Algorithms 81(3): 915-946 (2019) - [j29]Roberto Andreani, Nadia S. Fazzio, María Laura Schuverdt, Leonardo D. Secchin
A Sequential Optimality Condition Related to the Quasi-normality Constraint Qualification and Its Algorithmic Consequences. SIAM J. Optim. 29(1): 743-766 (2019) - [j28]Roberto Andreani, Gabriel Haeser, Leonardo D. Secchin
New Sequential Optimality Conditions for Mathematical Programs with Complementarity Constraints and Algorithmic Consequences. SIAM J. Optim. 29(4): 3201-3230 (2019) - 2018
- [j27]Roberto Andreani, José Mario Martínez
Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization. Math. Oper. Res. 43(3): 693-717 (2018) - [j26]Roberto Andreani, Leonardo D. Secchin
Convergence Properties of a Second Order Augmented Lagrangian Method for Mathematical Programs with Complementarity Constraints. SIAM J. Optim. 28(3): 2574-2600 (2018) - 2017
- [j25]Roberto Andreani, Roger Behling, Gabriel Haeser
On second-order optimality conditions in nonlinear optimization. Optim. Methods Softw. 32(1): 22-38 (2017) - 2016
- [j24]Roberto Andreani, Joaquim João Júdice
Feasibility problems with complementarity constraints. Eur. J. Oper. Res. 249(1): 41-54 (2016) - [j23]Roberto Andreani, José Mario Martínez
Newton's method may fail to recognize proximity to optimal points in constrained optimization. Math. Program. 160(1-2): 547-555 (2016) - [j22]Roberto Andreani, José Mario Martínez
A Cone-Continuity Constraint Qualification and Algorithmic Consequences. SIAM J. Optim. 26(1): 96-110 (2016) - 2014
- [j21]Roberto Andreani, José Mario Martínez
On the behaviour of constrained optimization methods when Lagrange multipliers do not exist. Optim. Methods Softw. 29(3): 646-657 (2014) - 2013
- [j20]Roberto Andreani, Ellen H. Fukuda, Paulo J. S. Silva
A Gauss-Newton Approach for Solving Constrained Optimization Problems Using Differentiable Exact Penalties. J. Optim. Theory Appl. 156(2): 417-449 (2013) - 2012
- [j19]Roberto Andreani, Gabriel Haeser
A relaxed constant positive linear dependence constraint qualification and applications. Math. Program. 135(1-2): 255-273 (2012) - [j18]Roberto Andreani, Gabriel Haeser
Two New Weak Constraint Qualifications and Applications. SIAM J. Optim. 22(3): 1109-1135 (2012) - 2011
- [j17]Roberto Andreani, Joaquim João Júdice
On the natural merit function for solving complementarity problems. Math. Program. 130(1): 211-223 (2011) - [j16]Roberto Andreani, Joaquim Júdice
A projected-gradient interior-point algorithm for complementarity problems. Numer. Algorithms 57(4): 457-485 (2011) - 2010
- [j15]Roberto Andreani, Ernesto G. Birgin
Second-order negative-curvature methods for box-constrained and general constrained optimization. Comput. Optim. Appl. 45(2): 209-236 (2010) - [j14]Roberto Andreani, José Mario Martínez, Benar Fux Svaiter
A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences. SIAM J. Optim. 20(6): 3533-3554 (2010)
2000 – 2009
- 2009
- [j13]Roberto Andreani, S. L. C. Castro, J. L. Chela, Ana Friedlander, Sandra Augusta Santos
An inexact-restoration method for nonlinear bilevel programming problems. Comput. Optim. Appl. 43(3): 307-328 (2009) - [j12]Roberto Andreani, José Mario Martínez
Low Order-Value Optimization and applications. J. Glob. Optim. 43(1): 1-22 (2009) - 2008
- [j11]Roberto Andreani, Ana Friedlander, Margarida P. Mello, Sandra Augusta Santos
Box-constrained minimization reformulations of complementarity problems in second-order cones. J. Glob. Optim. 40(4): 505-527 (2008) - [j10]Roberto Andreani, Ernesto G. Birgin
Augmented Lagrangian methods under the constant positive linear dependence constraint qualification. Math. Program. 111(1-2): 5-32 (2008) - [j9]Roberto Andreani, José Mario Martínez
Continuous optimization methods for structure alignments. Math. Program. 112(1): 93-124 (2008) - 2007
- [j8]Leandro Martínez
Convergent algorithms for protein structural alignment. BMC Bioinform. 8 (2007) - [j7]Roberto Andreani, Ernesto G. Birgin
On Augmented Lagrangian Methods with General Lower-Level Constraints. SIAM J. Optim. 18(4): 1286-1309 (2007) - 2005
- [j6]Roberto Andreani, Cibele Dunder, José Mario Martínez
Nonlinear-programming reformulation of the order-value optimization problem. Math. Methods Oper. Res. 61(3): 365-384 (2005) - 2003
- [j5]Roberto Andreani, Cibele Dunder, José Mario Martínez
Order-Value Optimization: Formulation and solution by means of a primal cauchy method. Math. Methods Oper. Res. 58(3): 387-399 (2003) - 2002
- [j4]Roberto Andreani, Ana Friedlander:
Bound Constrained Smooth Optimization for Solving Variational Inequalities and Related Problems. Ann. Oper. Res. 116(1-4): 179-198 (2002) - [j3]Roberto Andreani, Ana Friedlander, Sandra Augusta Santos
On the Resolution of the Generalized Nonlinear Complementarity Problem. SIAM J. Optim. 12(2): 303-321 (2002) - 2001
- [j2]Roberto Andreani, José Mario Martínez
On the solution of mathematical programming problems with equilibrium constraints. Math. Methods Oper. Res. 54(3): 345-358 (2001) - 2000
- [j1]Roberto Andreani, José Mario Martínez
Reformulation of Variational Inequalities on a Simplex and Compactification of Complementarity Problems. SIAM J. Optim. 10(3): 878-895 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 22:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: