Javier Peña
Orcid: 0000-0001-5698-1918Affiliations:
- Carnegie Mellon University, Tepper School of Business, Pittsburgh, PA, USA
According to our database1,
Javier Peña
authored at least 54 papers
between 2000 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
7
1
3
1
3
1
2
2
3
3
5
1
3
6
2
2
2
1
2
1
1
2
1
2
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
An easily computable upper bound on the Hoffman constant for homogeneous inequality systems.
Comput. Optim. Appl., January, 2024
2023
SIAM J. Optim., December, 2023
Implementation of a projection and rescaling algorithm for second-order conic feasibility problems.
Optim. Methods Softw., January, 2023
2022
Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems.
Math. Oper. Res., November, 2022
2021
Optim. Methods Softw., 2021
Math. Program., 2021
2020
SIAM J. Optim., 2020
2019
SIAM J. Optim., 2019
Math. Oper. Res., 2019
2017
2016
Optim. Methods Softw., 2016
2015
Oper. Res. Lett., 2015
2014
Optim. Methods Softw., 2014
Fast computation of zeros of polynomial systems with bounded degree under finite-precision.
Math. Comput., 2014
J. Complex., 2014
Comput. Optim. Appl., 2014
Proceedings of the 31th International Conference on Machine Learning, 2014
2013
Math. Program., 2013
2012
First-order algorithm with 𝒪(ln(1/ε)) convergence for ε-equilibrium in two-person zero-sum games.
Math. Program., 2012
Computing arbitrage upper bounds on basket options in the presence of bid-ask spreads.
Eur. J. Oper. Res., 2012
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012
2010
Applying Metric Regularity to Compute a Condition Measure of a Smoothing Algorithm for Matrix Games.
SIAM J. Optim., 2010
Math. Program., 2010
Math. Oper. Res., 2010
J. Complex., 2010
An Efficient Proximal-Gradient Method for Single and Multi-task Regression with Structured Sparsity
CoRR, 2010
Computing general static-arbitrage bounds for European basket options via Dantzig-Wolfe decomposition.
Algorithmic Oper. Res., 2010
2009
Eur. J. Oper. Res., 2009
Eur. J. Oper. Res., 2009
2008
First-Order Algorithm with O(ln(1/e)) Convergence for e-Equilibrium in Two-Person Zero-Sum Games.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008
2007
SIAM J. Optim., 2007
Proceedings of the Internet and Network Economics, Third International Workshop, 2007
2006
2005
Math. Program., 2005
Math. Oper. Res., 2005
2004
2003
2002
A Primal-Dual Algorithm for Solving Polyhedral Conic Systems with a Finite-Precision Machine.
SIAM J. Optim., 2002
Two properties of condition numbers for convex programs via implicitly defined barrier functions.
Math. Program., 2002
2001
Math. Oper. Res., 2001
2000
SIAM J. Optim., 2000
Math. Program., 2000