default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrés Gómez 0001
Person information
- affiliation: University of Southern California, Los Angeles, CA, USA
- affiliation: University of Pittsburgh, Swanson School of Engineering, Department of Industrial Engineering, PA, USA
- affiliation (former): University of California, Berkeley, CA, USA
Other persons with the same name
- Andrés Gómez (aka: Andres Gomez) — disambiguation page
- Andrés Gómez 0002
![[0000-0001-7272-8488]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0001-7272-8488")
(aka: Andrés Gómez-Tato) — Galicia Supercomputing Centre (CESGA), Santiago de Compostela, Spain - Andrés Gómez-Rodellar (aka: Andrés Gómez 0003) — Technical University of Madrid, Montegancedo Campus, Center for Biomedical Technology, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Ziyu He, Shaoning Han, Andrés Gómez, Ying Cui, Jong-Shi Pang:
Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix. Math. Program. 204(1): 517-566 (2024)- [j22]Linchuan Wei, Alper Atamtürk, Andrés Gómez, Simge Küçükyavuz:
On the convex hull of convex quadratic optimization problems with indicators. Math. Program. 204(1): 703-737 (2024) - [j21]Andrés Gómez, Weijun Xie:
A note on quadratic constraints with indicator variables: Convex hull description and perspective relaxation. Oper. Res. Lett. 52: 107059 (2024) - [i16]Valentina Cepeda, Andrés Gómez, Shaoning Han:
Robust support vector machines via conic optimization. CoRR abs/2402.01797 (2024) - 2023
- [j20]Andrés Gómez, Ziyu He, Jong-Shi Pang:
Linear-step solvability of some folded concave and singly-parametric sparse optimization problems. Math. Program. 198(2): 1339-1380 (2023) - [j19]Peijing Liu, Salar Fattahi, Andrés Gómez, Simge Küçükyavuz:
A graph-based decomposition method for convex quadratic optimization with indicators. Math. Program. 200(2): 669-701 (2023) - [j18]Alper Atamtürk, Andrés Gómez:
Supermodularity and valid inequalities for quadratic optimization with indicators. Math. Program. 201(1): 295-338 (2023) - [j17]Shaoning Han, Andrés Gómez, Alper Atamtürk:
$\mathbf {2\times 2}$-Convexifications for convex quadratic optimization with indicator variables. Math. Program. 202(1): 95-134 (2023) - [c4]Nathanael Jo, Sina Aghaei, Jack Benson, Andrés Gómez, Phebe Vayanos:
Learning Optimal Fair Decision Trees: Trade-offs Between Interpretability, Fairness, and Accuracy. AIES 2023: 181-192 - [i15]Ryan Cory-Wright, Andrés Gómez:
Gain Confidence, Reduce Disappointment: A New Approach to Cross-Validation for Sparse Regression. CoRR abs/2306.14851 (2023) - [i14]Salar Fattahi, Andrés Gómez:
Solution Path of Time-varying Markov Random Fields with Discrete Regularization. CoRR abs/2307.13750 (2023) - [i13]Patrick Vossler, Sina Aghaei, Nathan Justin, Nathanael Jo, Andrés Gómez, Phebe Vayanos:
ODTlearn: A Package for Learning Optimal Decision Trees for Prediction and Prescription. CoRR abs/2307.15691 (2023) - [i12]Nathan Justin, Sina Aghaei, Andrés Gómez, Phebe Vayanos:
Learning Optimal Classification Trees Robust to Distribution Shifts. CoRR abs/2310.17772 (2023) - 2022
- [j16]Shaoning Han, Andrés Gómez, Oleg A. Prokopyev:
Fractional 0-1 programming and submodularity. J. Glob. Optim. 84(1): 77-93 (2022) - [j15]Linchuan Wei, Andrés Gómez, Simge Küçükyavuz:
Ideal formulations for constrained convex optimization problems with indicator variables. Math. Program. 192(1): 57-88 (2022) - [j14]Shaoning Han, Andrés Gómez, Alper Atamtürk:
The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables. Oper. Res. Lett. 50(2): 195-198 (2022) - [i11]Linchuan Wei, Alper Atamtürk, Andrés Gómez, Simge Küçükyavuz:
On the convex hull of convex quadratic optimization problems with indicators. CoRR abs/2201.00387 (2022) - [i10]Nathanael Jo, Sina Aghaei, Jack Benson, Andrés Gómez, Phebe Vayanos:
Learning Optimal Fair Classification Trees. CoRR abs/2201.09932 (2022) - 2021
- [j13]Erfan Mehmanchi, Andrés Gómez, Oleg A. Prokopyev:
Solving a class of feature selection problems via fractional 0-1 programming. Ann. Oper. Res. 303(1): 265-295 (2021) - [j12]Andrés Gómez, Oleg A. Prokopyev:
A Mixed-Integer Fractional Optimization Approach to Best Subset Selection. INFORMS J. Comput. 33(2): 551-565 (2021) - [j11]Alper Atamtürk, Andrés Gómez, Shaoning Han:
Sparse and Smooth Signal Estimation: Convexification of L0-Formulations. J. Mach. Learn. Res. 22: 52:1-52:43 (2021) - [j10]Andrés Gómez:
Strong formulations for conic quadratic optimization with indicator variables. Math. Program. 188(1): 193-226 (2021) - [j9]Andrés Gómez:
Outlier Detection in Time Series via Mixed-Integer Conic Quadratic Optimization. SIAM J. Optim. 31(3): 1897-1925 (2021) - [c3]Salar Fattahi, Andrés Gómez:
Scalable Inference of Sparsely-changing Gaussian Markov Random Fields. NeurIPS 2021: 6529-6541 - [i9]Salar Fattahi, Andrés Gómez:
Scalable Inference of Sparsely-changing Markov Random Fields with Strong Statistical Guarantees. CoRR abs/2102.03585 (2021) - [i8]Sina Aghaei, Andrés Gómez, Phebe Vayanos:
Strong Optimal Classification Trees. CoRR abs/2103.15965 (2021) - [i7]Nathanael Jo, Sina Aghaei, Andrés Gómez, Phebe Vayanos:
Learning Optimal Prescriptive Trees from Observational Data. CoRR abs/2108.13628 (2021) - 2020
- [j8]Erfan Mehmanchi, Colin P. Gillen, Andrés Gómez, Oleg A. Prokopyev:
On Robust Fractional 0-1 Programming. INFORMS J. Optim. 2(2): 96-133 (2020) - [j7]Alper Atamtürk, Andrés Gómez:
Submodularity in Conic Quadratic Mixed 0-1 Optimization. Oper. Res. 68(2): 609-630 (2020) - [c2]Alper Atamtürk, Andrés Gómez:
Safe screening rules for L0-regression from Perspective Relaxations. ICML 2020: 421-430 - [c1]Linchuan Wei, Andrés Gómez, Simge Küçükyavuz:
On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables. IPCO 2020: 433-447 - [i6]Sina Aghaei, Andrés Gómez, Phebe Vayanos:
Learning Optimal Classification Trees: Strong Max-Flow Formulations. CoRR abs/2002.09142 (2020) - [i5]Alper Atamtürk, Andrés Gómez:
Safe Screening Rules for 𝓁0-Regression. CoRR abs/2004.08773 (2020) - [i4]Linchuan Wei, Andrés Gómez, Simge Küçükyavuz:
Ideal formulations for constrained convex optimization problems with indicator variables. CoRR abs/2007.00107 (2020) - [i3]Alper Atamtürk, Andrés Gómez:
Supermodularity and valid inequalities for quadratic optimization with indicators. CoRR abs/2012.14633 (2020)
2010 – 2019
- 2019
- [j6]Erfan Mehmanchi, Andrés Gómez, Oleg A. Prokopyev:
Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations. J. Glob. Optim. 75(2): 273-339 (2019) - [j5]Alper Atamtürk, Andrés Gómez:
Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra. Math. Program. Comput. 11(2): 311-340 (2019) - [i2]Alper Atamtürk, Andrés Gómez:
Rank-one Convexification for Sparse Regression. CoRR abs/1901.10334 (2019) - 2018
- [j4]Alper Atamtürk, Andrés Gómez:
Strong formulations for quadratic optimization with M-matrices and indicator variables. Math. Program. 170(1): 141-176 (2018) - [i1]Alper Atamtürk, Andrés Gómez, Shaoning Han:
Sparse and Smooth Signal Estimation: Convexification of L0 Formulations. CoRR abs/1811.02655 (2018) - 2017
- [j3]Alper Atamtürk, Andrés Gómez:
Maximizing a Class of Utility Functions Over the Vertices of a Polytope. Oper. Res. 65(2): 433-445 (2017) - 2016
- [j2]Alper Atamtürk, Andrés Gómez, Simge Küçükyavuz:
Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems. Networks 67(4): 299-315 (2016) - [j1]Andrés Gómez, Ricardo Mariño, Raha Akhavan-Tabatabaei, Andrés L. Medaglia, Jorge E. Mendoza:
On Modeling Stochastic Travel and Service Times in Vehicle Routing. Transp. Sci. 50(2): 627-641 (2016)
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-10 21:49 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:
