default search action
Luís Nunes Vicente
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j56]Suyun Liu, Luís Nunes Vicente
:
The stochastic multi-gradient algorithm for multi-objective optimization and its application to supervised machine learning. Ann. Oper. Res. 339(3): 1119-1148 (2024) - [j55]Clément W. Royer, Oumaima Sohab, Luís Nunes Vicente:
Full-low evaluation methods for bound and linearly constrained derivative-free optimization. Comput. Optim. Appl. 89(2): 279-315 (2024) - [j54]Francesco Rinaldi, Luís Nunes Vicente, Damiano Zeffiro
Stochastic Trust-Region and Direct-Search Methods: A Weak Tail Bound Condition and Reduced Sample Sizing. SIAM J. Optim. 34(2): 2067-2092 (2024) - 2023
- [j53]Suyun Liu
Convergence Rates of the Stochastic Alternating Algorithm for Bi-Objective Optimization. J. Optim. Theory Appl. 198(1): 165-186 (2023) - [j52]Albert S. Berahas
Full-low evaluation methods for derivative-free optimization. Optim. Methods Softw. 38(2): 386-411 (2023) - [i9]Tommaso Giovannelli, Oumaima Sohab, Luís Nunes Vicente:
The limitation of neural nets for approximation and optimization. CoRR abs/2311.12253 (2023) - 2022
- [j51]Suyun Liu, Luís Nunes Vicente
Accuracy and fairness trade-offs in machine learning: a stochastic multi-objective approach. Comput. Manag. Sci. 19(3): 513-537 (2022) - [c4]Suyun Liu
A Stochastic Alternating Balance k-Means Algorithm for Fair Clustering. LION 2022: 77-92 - [i8]Suyun Liu, Luís Nunes Vicente:
Convergence rates of the stochastic alternating algorithm for bi-objective optimization. CoRR abs/2203.10605 (2022) - 2021
- [i7]Suyun Liu, Luís Nunes Vicente:
A Stochastic Alternating Balance k-Means Algorithm for Fair Clustering. CoRR abs/2105.14172 (2021) - [i6]Suyun Liu, Luís Nunes Vicente:
The Sharpe predictor for fairness in machine learning. CoRR abs/2108.06415 (2021) - [i5]Tommaso Giovannelli, Griffin Kent, Luís Nunes Vicente:
Bilevel stochastic methods for optimization and machine learning: Bilevel stochastic descent and DARTS. CoRR abs/2110.00604 (2021) - 2020
- [j50]Serge Gratton, Clément W. Royer
A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds. Math. Program. 179(1): 195-222 (2020) - [i4]Suyun Liu, Luís Nunes Vicente:
Accuracy and Fairness Trade-offs in Machine Learning: A Stochastic Multi-Objective Approach. CoRR abs/2008.01132 (2020)
2010 – 2019
- 2019
- [j49]Serge Gratton, Clément W. Royer
Direct search based on probabilistic feasible descent for bound and linearly constrained problems. Comput. Optim. Appl. 72(3): 525-559 (2019) - [j48]Jörg Fliege
Complexity of gradient descent for multiobjective optimization. Optim. Methods Softw. 34(5): 949-959 (2019) - [j47]Giampaolo Liuzzi, Stefano Lucidi, Francesco Rinaldi, Luís Nunes Vicente
Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions. SIAM J. Optim. 29(4): 3012-3035 (2019) - [i3]Suyun Liu, Luís Nunes Vicente:
The stochastic multi-gradient algorithm for multi-objective optimization and its application to supervised machine learning. CoRR abs/1907.04472 (2019) - [i2]Lili Song, Luís Nunes Vicente:
Modeling Hessian-vector products in nonlinear optimization: New Hessian-free methods. CoRR abs/1912.10523 (2019) - 2017
- [j46]Serge Gratton, N. Soualmi, Luís Nunes Vicente
An indicator for the switch from derivative-free to derivative-based optimization. Oper. Res. Lett. 45(4): 353-361 (2017) - 2016
- [j45]El Houcine Bergou, Serge Gratton, Luís Nunes Vicente
Levenberg-Marquardt Methods Based on Probabilistic Gradient Models and Inexact Subproblem Solution, with Application to Data Assimilation. SIAM/ASA J. Uncertain. Quantification 4(1): 924-951 (2016) - [j44]Mahdi Dodangeh
Worst case complexity of direct search under convexity. Math. Program. 155(1-2): 307-332 (2016) - [j43]Mahdi Dodangeh
On the optimal order of worst case complexity of direct search. Optim. Lett. 10(4): 699-708 (2016) - [j42]Rohollah Garmanjani
Trust-Region Methods Without Using Derivatives: Worst Case Complexity and the NonSmooth Case. SIAM J. Optim. 26(4): 1987-2011 (2016) - 2015
- [j41]Youssef Diouane
Globally convergent evolution strategies for constrained optimization. Comput. Optim. Appl. 62(2): 323-346 (2015) - [j40]Youssef Diouane
Globally convergent evolution strategies. Math. Program. 152(1-2): 467-490 (2015) - [j39]Serge Gratton, Clément W. Royer
Direct Search Based on Probabilistic Descent. SIAM J. Optim. 25(3): 1515-1541 (2015) - 2014
- [j38]Hoai An Le Thi
Globally convergent DC trust-region methods. J. Glob. Optim. 59(2-3): 209-225 (2014) - [j37]Serge Gratton, Luís Nunes Vicente
A surrogate management framework using rigorous trust-region steps. Optim. Methods Softw. 29(1): 10-23 (2014) - [j36]Afonso S. Bandeira, Katya Scheinberg
Convergence of Trust-Region Methods Based on Probabilistic Models. SIAM J. Optim. 24(3): 1238-1264 (2014) - [j35]Serge Gratton, Luís Nunes Vicente
A Merit Function Approach for Direct Search. SIAM J. Optim. 24(4): 1980-1998 (2014) - 2013
- [j34]Luís Nunes Vicente:
Worst case complexity of direct search. EURO J. Comput. Optim. 1(1-2): 143-153 (2013) - [j33]M. Li, Luís Nunes Vicente
Inexact solution of NLP subproblems in MINLP. J. Glob. Optim. 55(4): 877-899 (2013) - [c3]Rui Pedro Brito
Efficient Cardinality/Mean-Variance Portfolios. System Modelling and Optimization 2013: 52-73 - [i1]Afonso S. Bandeira, Katya Scheinberg, Luís Nunes Vicente:
On partial sparse recovery. CoRR abs/1304.2809 (2013) - 2012
- [j32]Luís Nunes Vicente
Analysis of direct searches for discontinuous functions. Math. Program. 133(1-2): 299-325 (2012) - [j31]Afonso S. Bandeira, Katya Scheinberg
Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization. Math. Program. 134(1): 223-257 (2012) - [j30]Andrew R. Conn, Luís Nunes Vicente
Bilevel derivative-free optimization and its application to robust optimization. Optim. Methods Softw. 27(3): 561-577 (2012) - 2011
- [j29]Ana Margarida Monteiro, Reha H. Tütüncü, Luís Nunes Vicente
Estimation of risk-neutral density surfaces. Comput. Manag. Sci. 8(4): 387-414 (2011) - [j28]Ana Luísa Custódio, J. F. Aguilar Madeira
Direct Multisearch for Multiobjective Optimization. SIAM J. Optim. 21(3): 1109-1140 (2011) - 2010
- [j27]Ana Luísa Custódio, Humberto Rocha
Incorporating minimum Frobenius norm models in direct search. Comput. Optim. Appl. 46(2): 265-278 (2010)
2000 – 2009
- 2009
- [b1]Andrew R. Conn, Katya Scheinberg, Luís Nunes Vicente:
Introduction to Derivative-Free Optimization. MPS-SIAM series on optimization 8, SIAM 2009, ISBN 978-0-89871-668-9, pp. I-XII, 1-277 - [j26]Luís Nunes Vicente
Implicitly and densely discrete black-box optimization problems. Optim. Lett. 3(3): 475-482 (2009) - [j25]A. Ismael F. Vaz
PSwarm: a hybrid solver for linearly constrained global derivative-free optimization. Optim. Methods Softw. 24(4-5): 669-685 (2009) - [j24]Andrew R. Conn, Katya Scheinberg
Global Convergence of General Derivative-Free Trust-Region Algorithms to First- and Second-Order Critical Points. SIAM J. Optim. 20(1): 387-415 (2009) - [r1]Luís Nunes Vicente:
Bilevel Programming: Introduction, History and Overview. Encyclopedia of Optimization 2009: 266-269 - 2008
- [j23]R. Silva, João Soares
Local analysis of the feasible primal-dual interior-point method. Comput. Optim. Appl. 40(1): 41-57 (2008) - [j22]Ana Margarida Monteiro, Reha H. Tütüncü, Luís Nunes Vicente
Recovering risk-neutral probability density functions from options prices using cubic splines and ensuring nonnegativity. Eur. J. Oper. Res. 187(2): 525-542 (2008) - [j21]Andrew R. Conn, Katya Scheinberg
Geometry of interpolation sets in derivative free optimization. Math. Program. 111(1-2): 141-172 (2008) - 2007
- [j20]A. Ismael F. Vaz
A particle swarm pattern search method for bound constrained global optimization. J. Glob. Optim. 39(2): 197-219 (2007) - [j19]Ana Luísa Custódio, Luís Nunes Vicente
Using Sampling and Simplex Derivatives in Pattern Search Methods. SIAM J. Optim. 18(2): 537-555 (2007) - 2005
- [j18]Michael Hintermüller
Space Mapping for Optimal Control of Partial Differential Equations. SIAM J. Optim. 15(4): 1002-1025 (2005) - 2004
- [j17]Michael Ulbrich
A globally convergent primal-dual interior-point filter method for nonlinear programming. Math. Program. 100(2): 379-410 (2004) - [j16]Pedro Alberto
Pattern Search Methods for User-Provided Points: Application to Molecular Geometry Problems. SIAM J. Optim. 14(4): 1216-1236 (2004) - 2002
- [j15]Luís Nunes Vicente
Local Convergence of a Primal-Dual Method for Degenerate Nonlinear Programming. Comput. Optim. Appl. 22(3): 311-328 (2002) - [j14]Luís Nunes Vicente
Local analysis of a new multipliers method. Eur. J. Oper. Res. 143(2): 432-451 (2002) - [j13]Matthias Heinkenschloss
Analysis of Inexact Trust-Region SQP Algorithms. SIAM J. Optim. 12(2): 283-302 (2002) - [c2]El-Sayed M. E. Mostafa
Numerical Behavior of a Stabilized SQP Method for Degenerate NLP Problems. COCOS 2002: 123-141 - 2001
- [c1]Pedro Alberto
Pattern Search Methods for Use-Provided Points. International Conference on Computational Science (2) 2001: 95-98 - 2000
- [j12]Luís Nunes Vicente
Local Convergence of the Affine-Scaling Interior-Point Algorithm for Nonlinear Programming. Comput. Optim. Appl. 17(1): 23-35 (2000)
1990 – 1999
- 1999
- [j11]David A. Andrews, Luís Nunes Vicente:
Characterization of the smoothness and curvature of a marginal function for a trust-region problem. Math. Program. 84(1): 123-135 (1999) - [j10]Andrew R. Conn, Luís Nunes Vicente, Chandu Visweswariah:
Two-Step Algorithms for Nonlinear Optimization with Structured Applications. SIAM J. Optim. 9(4): 924-947 (1999) - [j9]Matthias Heinkenschloss
An interface optimization and application for the numerical solution of optimal control problems. ACM Trans. Math. Softw. 25(2): 157-190 (1999) - 1997
- [j8]John E. Dennis, Luís Nunes Vicente
On the Convergence Theory of Trust-Region-Based Algorithms for Equality-Constrained Optimization. SIAM J. Optim. 7(4): 927-950 (1997) - 1994
- [j7]Joaquim João Júdice
On the solution and complexity of a generalized linear complementarity problem. J. Glob. Optim. 4(4): 415-424 (1994) - [j6]Luís Nunes Vicente
Bilevel and multilevel programming: A bibliography review. J. Glob. Optim. 5(3): 291-306 (1994) - [j5]Paul H. Calamai, Luís Nunes Vicente
Generating quadratic bilevel programming test problems. ACM Trans. Math. Softw. 20(1): 103-119 (1994) - [j4]Paul H. Calamai, Luís Nunes Vicente
Algorithm 728; FORTRAN subroutines for generating quadratic bilevel programming test problems. ACM Trans. Math. Softw. 20(1): 120-123 (1994) - 1993
- [j3]Paul H. Calamai, Luís Nunes Vicente
A new technique for generating quadratic programming test problems. Math. Program. 61: 215-231 (1993) - [j2]Paul H. Calamai, Luís Nunes Vicente:
Generating Linear and Linear-Quadratic Bilevel Programming Problems. SIAM J. Sci. Comput. 14(4): 770-782 (1993) - 1992
- [j1]Luís Nunes Vicente
Generation of disjointly constrained bilinear programming test problems. Comput. Optim. Appl. 1(3): 299-306 (1992)
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-22 21:15 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: