default search action
Gabriel Haeser
Person information
- affiliation: University of Sao Paulo, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j37]Luis Felipe Bueno, Gabriel Haeser
, Oliver Kolossoski
On the paper "Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem". Eur. J. Oper. Res. 313(3): 1217-1222 (2024) - [j36]Roberto Andreani, Ellen H. Fukuda, Gabriel Haeser
Optimality Conditions for Nonlinear Second-Order Cone Programming and Symmetric Cone Programming. J. Optim. Theory Appl. 200(1): 1-33 (2024) - [j35]Roberto Andreani, Gabriel Haeser, Leonardo M. Mito
Weak notions of nondegeneracy in nonlinear semidefinite programming. Math. Program. 205(1): 1-32 (2024) - [j34]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) - 2023
- [j33]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
- [j32]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) - [j31]Roberto Andreani
On Optimality Conditions for Nonlinear Conic Programming. Math. Oper. Res. 47(3): 2160-2185 (2022) - [j30]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) - [j29]Roberto Andreani
On the best achievable quality of limit points of augmented Lagrangian schemes. Numer. Algorithms 90(2): 851-877 (2022) - [j28]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) - [j27]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) - 2021
- [j26]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) - [j25]Gabriel Haeser, Oliver Hinder
On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods. Math. Program. 186(1): 257-288 (2021) - [j24]Gabriel Haeser
On constraint qualifications for second-order optimality conditions depending on a single Lagrange multiplier. Oper. Res. Lett. 49(6): 883-889 (2021) - 2020
- [j23]Ernesto G. Birgin, Walter Gómez
An Augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem. Comput. Appl. Math. 39(1) (2020) - [j22]Luis Felipe Bueno, Gabriel Haeser, Felipe Lara
An Augmented Lagrangian method for quasi-equilibrium problems. Comput. Optim. Appl. 76(3): 737-766 (2020) - [j21]Luis Felipe Bueno
Towards an efficient augmented Lagrangian method for convex quadratic programming. Comput. Optim. Appl. 76(3): 767-800 (2020) - [j20]Gabriel Haeser
New Constraint Qualifications with Second-Order Properties in Nonlinear Optimization. J. Optim. Theory Appl. 184(2): 494-506 (2020) - [j19]Gabriel Haeser, Alberto Ramos
Constraint Qualifications for Karush-Kuhn-Tucker Conditions in Multiobjective Optimization. J. Optim. Theory Appl. 187(2): 469-487 (2020) - [j18]Roberto Andreani, Gabriel Haeser
Optimality conditions and global convergence for nonlinear semidefinite programming. Math. Program. 180(1): 203-235 (2020)
2010 – 2019
- 2019
- [j17]Gabriel Haeser
Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary. Math. Program. 178(1-2): 263-299 (2019) - [j16]Luis Felipe Bueno
Optimality Conditions and Constraint Qualifications for Generalized Nash Equilibrium Problems and Their Practical Implications. SIAM J. Optim. 29(1): 31-54 (2019) - [j15]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
- [j14]Ernesto G. Birgin, Gabriel Haeser
Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points. Comput. Optim. Appl. 69(1): 51-75 (2018) - [j13]Gabriel Haeser
A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms. Comput. Optim. Appl. 70(2): 615-639 (2018) - [j12]Roger Behling, Gabriel Haeser
On a Conjecture in Second-Order Optimality Conditions. J. Optim. Theory Appl. 176(3): 625-633 (2018) - [j11]Gabriel Haeser
Some theoretical limitations of second-order algorithms for smooth constrained optimization. Oper. Res. Lett. 46(3): 295-299 (2018) - 2017
- [j10]Moiseis dos Santos Cecconello
On fuzzy uncertainties on the logistic equation. Fuzzy Sets Syst. 328: 107-121 (2017) - [j9]Gabriel Haeser
An Extension of Yuan's Lemma and Its Applications in Optimization. J. Optim. Theory Appl. 174(3): 641-649 (2017) - [j8]Roberto Andreani, Roger Behling, Gabriel Haeser
On second-order optimality conditions in nonlinear optimization. Optim. Methods Softw. 32(1): 22-38 (2017) - [i1]Gabriel Haeser, Hongcheng Liu, Yinyu Ye:
Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary. CoRR abs/1702.04300 (2017) - 2016
- [j7]Luis Felipe Bueno, Gabriel Haeser
An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization. Optim. Lett. 10(6): 1315-1325 (2016) - 2015
- [j6]Luis Felipe Bueno, Gabriel Haeser
A Flexible Inexact-Restoration Method for Constrained Optimization. J. Optim. Theory Appl. 165(1): 188-208 (2015) - [j5]Gabriel Haeser
Convergence detection for optimization algorithms: Approximate-KKT stopping criterion when Lagrange multipliers are not available. Oper. Res. Lett. 43(5): 484-488 (2015) - 2014
- [j4]Roger Behling, Clóvis C. Gonzaga, Gabriel Haeser
Primal-Dual Relationship Between Levenberg-Marquardt and Central Trajectories for Linearly Constrained Convex Optimization. J. Optim. Theory Appl. 162(3): 705-717 (2014) - 2012
- [j3]Roberto Andreani, Gabriel Haeser
A relaxed constant positive linear dependence constraint qualification and applications. Math. Program. 135(1-2): 255-273 (2012) - [j2]Roberto Andreani, Gabriel Haeser
Two New Weak Constraint Qualifications and Applications. SIAM J. Optim. 22(3): 1109-1135 (2012) - 2011
- [j1]Gabriel Haeser
On Approximate KKT Condition and its Extension to Continuous Variational Inequalities. J. Optim. Theory Appl. 149(3): 528-539 (2011)
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-10-23 21:26 CEST 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: