default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClóvis C. Gonzaga
Refine list
refinements active!
zoomed in on 0 of 0 records
view refined list in
export refined list as
refine by search term
refine by type
- |
- no options
- temporarily not available
refine by coauthor
- no options
- temporarily not available
refine by orcid
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by access 
- no options
- temporarily not available
2020 – today
- 2023
[j30]Karla Cristiane Arsie
, Clóvis C. Gonzaga, Elizabeth W. Karas, Gislaine A. Periçaro:
Non-anticipative risk-averse analysis with effective scenarios applied to long-term hydrothermal scheduling. Comput. Appl. Math. 42(3) (2023)- 2020
- [j29]Gislaine A. Periçaro, Elizabeth W. Karas, Clóvis C. Gonzaga, Débora Cintia Marcilio, Ana P. Oening, Luiz Carlos Matioli, Daniel H. M. Detzel, Klaus de Geus, Marcelo R. Bessa:
Optimal non-anticipative scenarios for nonlinear hydro-thermal power systems. Appl. Math. Comput. 387: 124820 (2020) - no results
2010 – 2019
- 2016
- [j28]Clóvis C. Gonzaga, Ruana M. Schneider:
On the steepest descent algorithm for quadratic functions. Comput. Optim. Appl. 63(2): 523-542 (2016) - [j27]Clóvis C. Gonzaga:
On the worst case performance of the steepest descent algorithm for quadratic functions. Math. Program. 160(1-2): 307-320 (2016) - 2014
- [j26]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) - 2013
- [j25]Clóvis C. Gonzaga, Elizabeth W. Karas:
Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming. Math. Program. 138(1-2): 141-166 (2013) - [j24]Clóvis C. Gonzaga, Elizabeth W. Karas, Diane R. Rossetto:
An Optimal Algorithm for Constrained Differentiable Convex Optimization. SIAM J. Optim. 23(4): 1939-1955 (2013) - no results
2000 – 2009
- 2008
- [j23]Clóvis C. Gonzaga, Jin Yun Yuan:
Foz2006 numerical linear algebra and optimization. Numer. Linear Algebra Appl. 15(10): 887-889 (2008) - [j22]Luiz Carlos Matioli, Clóvis C. Gonzaga:
A new family of penalties for augmented Lagrangian methods. Numer. Linear Algebra Appl. 15(10): 925-944 (2008) - [j21]Ademir A. Ribeiro, Elizabeth W. Karas, Clóvis C. Gonzaga:
Global Convergence of Filter Methods for Nonlinear Programming. SIAM J. Optim. 19(3): 1231-1249 (2008) - 2005
- [j20]Jean Charles Gilbert, Clóvis C. Gonzaga, Elizabeth W. Karas:
Examples of ill-behaved central paths in convex optimization. Math. Program. 103(1): 63-94 (2005) - 2004
- [j19]Clóvis C. Gonzaga, Marli Cardia:
Properties of the Central Points in Linear Programming Problems. Numer. Algorithms 35(2-4): 185-204 (2004) - [j18]Clóvis C. Gonzaga, Elizabeth W. Karas, Márcia Vanti:
A Globally Convergent Filter Method for Nonlinear Programming. SIAM J. Optim. 14(3): 646-669 (2004) - 2003
- [j17]Clóvis C. Gonzaga, Rómulo A. Castillo:
A nonlinear programming algorithm based on non-coercive penalty functions. Math. Program. 96(1): 87-101 (2003) - 2002
- [j16]Fernanda Raupp, Clóvis C. Gonzaga:
A Center Cutting Plane Algorithm for a Likelihood Estimate Problem. Comput. Optim. Appl. 21(3): 277-300 (2002) - no results
1990 – 1999
- 1999
- [j15]Clóvis C. Gonzaga:
Complexity of Predictor-Corrector Algorithms for LCP Based on a Large Neighborhood of the Central Path. SIAM J. Optim. 10(1): 183-194 (1999) - 1997
- [j14]Clóvis C. Gonzaga, Richard A. Tapia:
On the Convergence of the Mizuno-Todd-Ye Algorithm to the Analytic Center of the Solution Set. SIAM J. Optim. 7(1): 47-65 (1997) - [j13]Clóvis C. Gonzaga, Richard A. Tapia:
On the Quadratic Convergence of the Simplified Mizuno-Todd-Ye Algorithm for Linear Programming. SIAM J. Optim. 7(1): 66-85 (1997) - 1996
- [j12]J. Frédéric Bonnans, Clóvis C. Gonzaga:
Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem. Math. Oper. Res. 21(1): 1-25 (1996) - [j11]Clóvis C. Gonzaga, J. Frédéric Bonnans:
Fast convergence of the simplified largest step path following algorithm. Math. Program. 76: 95-115 (1996) - [j10]Clóvis C. Gonzaga:
The largest step path following algorithm for monotone linear complementarity problems. Math. Program. 76: 309-332 (1996) - 1992
- [j9]Clóvis C. Gonzaga, Michael J. Todd:
An (O√(n) L)-Iteration Large-Step Primal-Dual Affine Algorithm for Linear Programming. SIAM J. Optim. 2(3): 349-359 (1992) - [j8]Clóvis C. Gonzaga:
Path-Following Methods for Linear Programming. SIAM Rev. 34(2): 167-224 (1992) - 1991
- [j7]Clóvis C. Gonzaga:
Search Directions for Interior Linear-Programming Methods. Algorithmica 6(2): 153-181 (1991) - [j6]Clóvis C. Gonzaga:
Polynomial affine algorithms for linear programming. Math. Program. 49: 7-21 (1991) - [j5]Clóvis C. Gonzaga:
Interior point algorithms for linear programming with inequality constraints. Math. Program. 52: 209-225 (1991) - [j4]Clóvis C. Gonzaga:
On lower bound updates in primal potential reduction methods for linear programming. Math. Program. 52: 415-428 (1991) - [j3]Clóvis C. Gonzaga:
Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method. SIAM J. Optim. 1(2): 268-279 (1991) - [j2]Clóvis C. Gonzaga:
Large Step Path-Following Methods for Linear Programming, Part II: Potential Reduction Method. SIAM J. Optim. 1(2): 280-292 (1991) - no results
1980 – 1989
- 1989
- [j1]Clóvis C. Gonzaga:
Conical projection algorithms for linear programming. Math. Program. 43(1-3): 151-173 (1989) - no results
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.
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.
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.
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 2025-06-17 00:23 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:
