Stephen A. Vavasis

Math. Program. Comput., June, 2024

2023

Re-embedding data to strengthen recovery guarantees of clustering.

[BibT_eX]

[DOI]

Tao Jiang

Samuel Tan

CoRR, 2023

2022

Low-rank matrix recovery with Ky Fan 2-k-norm.

[BibT_eX]

[DOI]

J. Glob. Optim., 2022

2021

Robust Correlation Clustering with Asymmetric Noise.

[BibT_eX]

[DOI]

Jimit Majmudar

CoRR, 2021

2020

On identifying clusters from sum-of-norms clustering computation.

[BibT_eX]

[DOI]

Tao Jiang

CoRR, 2020

Provable Overlapping Community Detection in Weighted Graphs.

[BibT_eX]

[DOI]

Jimit Majmudar

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019

Second-order cone interior-point method for quasistatic and moderate dynamic cohesive fracture.

[BibT_eX]

[DOI]

Katerina D. Papoulia

M. Reza Hirmand

CoRR, 2019

Recovery of a mixture of Gaussians by sum-of-norms clustering.

[BibT_eX]

[DOI]

Tao Jiang

Chen Wen Zhai

CoRR, 2019

2018

On the Complexity of Robust PCA and ℓ1-Norm Low-Rank Matrix Approximation.

[BibT_eX]

[DOI]

Math. Oper. Res., 2018

2017

IMRO: A Proximal Quasi-Newton Method for Solving ℓ1-Regularized Least Squares Problems.

[BibT_eX]

[DOI]

Sahar Karimi

SIAM J. Optim., 2017

2016

Finding the Largest Low-Rank Clusters With Ky Fan 2-k-Norm and ℓ1-Norm.

[BibT_eX]

[DOI]

SIAM J. Optim., 2016

2015

Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization.

[BibT_eX]

[DOI]

SIAM J. Optim., 2015

Extreme point inequalities and geometry of the rank sparsity ball.

[BibT_eX]

[DOI]

Dmitriy Drusvyatskiy

Henry Wolkowicz

Math. Program., 2015

On the Complexity of Robust PCA and ℓ1-norm Low-Rank Matrix Approximation.

[BibT_eX]

[DOI]

CoRR, 2015

2014

Fast and Robust Recursive Algorithmsfor Separable Nonnegative Matrix Factorization.

[BibT_eX]

[DOI]

IEEE Trans. Pattern Anal. Mach. Intell., 2014

Convex optimization for the planted k-disjoint-clique problem.

[BibT_eX]

[DOI]

Brendan P. W. Ames

Math. Program., 2014

A log-barrier method for mesh quality improvement and untangling.

[BibT_eX]

[DOI]

Shankar P. Sastry

Christophe De Vleeschouwer

Eng. Comput., 2014

Proceedings of the second "international Traveling Workshop on Interactions between Sparse models and Technology" (iTWIST'14).

[BibT_eX]

[DOI]

Laurent Jacques

Jean-François Determe

Fred Maurice Ngolè Mboula

CoRR, 2014

2013

A Proximal Point Algorithm for Sequential Feature Extraction Applications.

[BibT_eX]

[DOI]

Kim-Chuan Toh

SIAM J. Sci. Comput., 2013

Finding Approximately Rank-One Submatrices with the Nuclear Norm and 퓁1-Norm.

[BibT_eX]

[DOI]

SIAM J. Optim., 2013

Some notes on applying computational divided differencing in optimization.

[BibT_eX]

[DOI]

CoRR, 2013

Convex relaxation for finding planted influential nodes in a social network.

[BibT_eX]

[DOI]

Lisa Elkin

Ting Kei Pong

CoRR, 2013

2012

A robust solution procedure for hyperelastic solids with large boundary deformation.

[BibT_eX]

[DOI]

Eng. Comput., 2012

Fast and Robust Recursive Algorithms for Separable Nonnegative Matrix Factorization

[BibT_eX]

[DOI]

CoRR, 2012

2011

A Condition Number Analysis of an Algorithm for Solving a System of Polynomial Equations with One Degree of Freedom.

[BibT_eX]

[DOI]

SIAM J. Sci. Comput., 2011

Nuclear norm minimization for the planted clique and biclique problems.

[BibT_eX]

[DOI]

Brendan P. W. Ames

Math. Program., 2011

A Log-Barrier Method for Mesh Quality Improvement.

[BibT_eX]

[DOI]

Shankar P. Sastry

Proceedings of the 20th International Meshing Roundtable, 2011

2009

Complexity Theory: Quadratic Programming.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Complexity Theory.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

On the Complexity of Nonnegative Matrix Factorization.

[BibT_eX]

[DOI]

SIAM J. Optim., 2009

Properties of Polynomial Bases Used in a Line-Surface Intersection Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Parallel Processing and Applied Mathematics, 2009

2008

A Condition Number Analysis of a Line-Surface Intersection Algorithm.

[BibT_eX]

[DOI]

SIAM J. Sci. Comput., 2008

Solving Elliptic Finite Element Systems in Near-Linear Time with Support Preconditioners.

[BibT_eX]

[DOI]

Erik G. Boman

Bruce Hendrickson

SIAM J. Numer. Anal., 2008

Nonnegative matrix factorization via rank-one downdate.

[BibT_eX]

[DOI]

Michael Biggs

Ali Ghodsi

Proceedings of the Machine Learning, 2008

2007

A Condition Number Analysis of a Surface-Surface Intersection Algorithm

[BibT_eX]

[DOI]

CoRR, 2007

2006

An Algorithm for Two-Dimensional Mesh Generation Based on the Pinwheel Tiling.

[BibT_eX]

[DOI]

Pritam Ganguly

Katerina D. Papoulia

SIAM J. Sci. Comput., 2006

2005

An Iterative Method for Solving Complex-Symmetric Systems Arising in Electrical Power Modeling.

[BibT_eX]

[DOI]

Victoria E. Howle

SIAM J. Matrix Anal. Appl., 2005

Accurate solution of polynomial equations using Macaulay resultant matrices.

[BibT_eX]

[DOI]

Guðbjörn F. Jónsson

Math. Comput., 2005

2004

Solving Polynomials with Small Leading Coefficients.

[BibT_eX]

[DOI]

Guðbjörn F. Jónsson

SIAM J. Matrix Anal. Appl., 2004

A linear weighted laplacian smoothing framework for warping tetrahedral meshes

[BibT_eX]

[DOI]

CoRR, 2004

A Fully Sparse Implementation of a Primal-Dual Interior-Point Potential Reduction Method for Semidefinite Programming

[BibT_eX]

[DOI]

CoRR, 2004

2003

A Bernstein-Bezier Sufficient Condition for Invertibility of Polynomial Mapping Functions

[BibT_eX]

[DOI]

CoRR, 2003

A Mesh Warping Algorithm Based on Weighted Laplacian Smoothing.

[BibT_eX]

[DOI]

Joaquim B. Cavalcante Neto

Proceedings of the 12th International Meshing Roundtable, 2003

Computational Science Simulations Based on Web Services.

[BibT_eX]

[DOI]

Proceedings of the Computational Science - ICCS 2003, 2003

2002

A Concise Representation of Geometry Suitable for Mesh Generation.

[BibT_eX]

[DOI]

Proceedings of the 11th International Meshing Roundtable, 2002

2001

Accurate Solution of Weighted Least Squares by Iterative Methods.

[BibT_eX]

[DOI]

Elena Y. Bobrovnikova

SIAM J. Matrix Anal. Appl., 2001

2000

Quality Mesh Generation in Higher Dimensions.

[BibT_eX]

[DOI]

Scott A. Mitchell

SIAM J. Comput., 2000

Parallel FEM Simulation of Crack Propagation - Challenges, Status, and Perspectives.

[BibT_eX]

[DOI]

Proceedings of the Parallel and Distributed Processing, 2000

1999

Convex Optimization.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

1998

Geometric Separators for Finite-Element Meshes.

[BibT_eX]

[DOI]

SIAM J. Sci. Comput., 1998

Numerical Conformal Mapping Using Cross-Ratios and Delaunay Triangulation.

[BibT_eX]

[DOI]

Tobin A. Driscoll

SIAM J. Sci. Comput., 1998

1997

Complete Orthogonal Decomposition for Weighted Least Squares.

[BibT_eX]

[DOI]

Patricia D. Hough

SIAM J. Matrix Anal. Appl., April, 1997

Separators for sphere-packings and nearest neighbor graphs.

[BibT_eX]

[DOI]

J. ACM, 1997

1996

A primal-dual interior point method whose running time depends only on the constraint matrix.

[BibT_eX]

[DOI]

Math. Program., 1996

Identifying an optimal basis in linear programming.

[BibT_eX]

[DOI]

Ann. Oper. Res., 1996

An Aspect Ratio Bound for Triangulating a d-Grid Cut by a Hyperplane (Extended Abstract).

[BibT_eX]

[DOI]

Scott A. Mitchell

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995

Condition numbers for polyhedra with real number data.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1995

Book review.

[BibT_eX]

[DOI]

J. Glob. Optim., 1995

1994

Stable Numerical Algorithms for Equilibrium Systems.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., October, 1994

Software section.

[BibT_eX]

[DOI]

J. Glob. Optim., 1994

An accelerated interior point method whose running time depends only on A (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

1993

Nested Dissection for Sparse Nullspace Bases.

[BibT_eX]

[DOI]

Julio Michael Stern

SIAM J. Matrix Anal. Appl., July, 1993

Black-Box Complexity of Local Minimization.

[BibT_eX]

[DOI]

SIAM J. Optim., 1993

1992

Preconditioning for Boundary Integral Equations.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 1992

Approximation algorithms for indefinite quadratic programming.

[BibT_eX]

[DOI]

Math. Program., 1992

Local minima for indefinite quadratic knapsack problems.

[BibT_eX]

[DOI]

Math. Program., 1992

Open questions in complexity theory for numerical optimization.

[BibT_eX]

[DOI]

Panos M. Pardalos

Math. Program., 1992

Quality Mesh Generation in Three Dimensions.

[BibT_eX]

[DOI]

Scott A. Mitchell

Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991

Automatic Domain Partitioning in Three Dimensions.

[BibT_eX]

[DOI]

SIAM J. Sci. Comput., 1991

On the solution of concave knapsack problems.

[BibT_eX]

[DOI]

Jorge J. Moré

Math. Program., 1991

Quadratic programming with one negative eigenvalue is NP-hard.

[BibT_eX]

[DOI]

Panos M. Pardalos

J. Glob. Optim., 1991

Density Graphs and Separators.

[BibT_eX]

[DOI]

Gary L. Miller

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

A Unified Geometric Approach to Graph Separators

[BibT_eX]

[DOI]

Gary L. Miller

Shang-Hua Teng

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990

Quadratic Programming is in NP.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1990

1989

Complexity of fixed point computations.

[BibT_eX]

[DOI]

PhD thesis, 1989

Gaussian Elimination with Pivoting is P-Complete.

[BibT_eX]

[DOI]

Christos H. Papadimitriou

SIAM J. Discret. Math., 1989

Exponential lower bounds for finding Brouwer fix points.

[BibT_eX]

[DOI]

Michael D. Hirsch

J. Complex., 1989

1987

Exponential Lower Bounds for Finding Brouwer Fixed Points (Extended Abstract)

[BibT_eX]

[DOI]

Michael D. Hirsch

Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1983

Analysis of polynomial approximation algorithms for constraint expressions.

[BibT_eX]

[DOI]

Karl J. Lieberherr