Javier Peña

Orcid: 0000-0001-5698-1918

Affiliations:
  • 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:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
An easily computable upper bound on the Hoffman constant for homogeneous inequality systems.
Comput. Optim. Appl., January, 2024

2023
Affine Invariant Convergence Rates of the Conditional Gradient Method.
SIAM J. Optim., December, 2023

Perturbed Fenchel duality and first-order methods.
Math. Program., March, 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
Computational performance of a projection and rescaling algorithm.
Optim. Methods Softw., 2021

New characterizations of Hoffman constants for systems of linear constraints.
Math. Program., 2021

The condition number of a function relative to a set.
Math. Program., 2021

2020
A Data-Independent Distance to Infeasibility for Linear Conic Systems.
SIAM J. Optim., 2020

2019
Convergence Rates of Proximal Gradient Methods via the Convex Conjugate.
SIAM J. Optim., 2019

Polytope Conditioning and Linear Convergence of the Frank-Wolfe Algorithm.
Math. Oper. Res., 2019

2017
Convergence of first-order methods via the convex conjugate.
Oper. Res. Lett., 2017

Solving Conic Systems via Projection and Rescaling.
Math. Program., 2017

2016
On the von Neumann and Frank-Wolfe Algorithms with Away Steps.
SIAM J. Optim., 2016

Towards a deeper geometric, analytic and algorithmic understanding of margins.
Optim. Methods Softw., 2016

A deterministic rescaled perceptron algorithm.
Math. Program., 2016

2015
A trade execution model under a composite dynamic coherent risk measure.
Oper. Res. Lett., 2015

Completely positive reformulations for polynomial optimization.
Math. Program., 2015

Solving second-order conic systems with variable precision.
Math. Program., 2015

2014
A smoothing stochastic gradient method for composite optimization.
Optim. Methods Softw., 2014

Some preconditioners for systems of linear inequalities.
Optim. Lett., 2014

Fast computation of zeros of polynomial systems with bounded degree under finite-precision.
Math. Comput., 2014

A condition-based algorithm for solving polyhedral feasibility problems.
J. Complex., 2014

A sparsity preserving stochastic gradient methods for sparse regression.
Comput. Optim. Appl., 2014

Margins, Kernels and Non-linear Smoothed Perceptrons.
Proceedings of the 31th International Conference on Machine Learning, 2014

2013
A complementarity partition theorem for multifold conic systems.
Math. Program., 2013

2012
A Smooth Perceptron Algorithm.
SIAM J. Optim., 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

Optimal Regularized Dual Averaging Methods for Stochastic Optimization.
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

Separable self-concordant spectral functions and a conjecture of Tunçel.
Math. Program., 2010

Smoothing Techniques for Computing Nash Equilibria of Sequential Games.
Math. Oper. Res., 2010

On strata of degenerate polyhedral cones, II: Relations between condition measures.
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
Third-order extensions of Lo's semiparametric bound for European call options.
Eur. J. Oper. Res., 2009

On strata of degenerate polyhedral cones I: Condition and distance to strata.
Eur. J. Oper. Res., 2009

2008
A Condition Number for Multifold Conic Systems.
SIAM J. Optim., 2008

Exploiting equalities in polynomial programming.
Oper. Res. Lett., 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
Computing the Stability Number of a Graph Via Linear and Semidefinite Programming.
SIAM J. Optim., 2007

A primal-dual symmetric relaxation for homogeneous conic systems.
J. Complex., 2007

Gradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007

2006
LMI Approximations for Cones of Positive Semidefinite Forms.
SIAM J. Optim., 2006

2005
On the block-structured distance to non-surjectivity of sublinear mappings.
Math. Program., 2005

A Conic Programming Approach to Generalized Tchebycheff Inequalities.
Math. Oper. Res., 2005

2004
Conic systems and sublinear mappings: equivalent approaches.
Oper. Res. Lett., 2004

2003
Unifying Condition Numbers for Linear Programming.
Math. Oper. Res., 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
Conditioning of Convex Programs from a Primal-Dual Perspective.
Math. Oper. Res., 2001

2000
Understanding the Geometry of Infeasible Perturbations of a Conic Linear System.
SIAM J. Optim., 2000

Computing approximate solutions for convex conic systems of constraints.
Math. Program., 2000


  Loading...