![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Stephen A. Vavasis
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j46]Sahar Karimi, Stephen A. Vavasis:
Nonlinear conjugate gradient for smooth convex functions. Math. Program. Comput. 16(2): 229-254 (2024) - 2023
- [i25]Tao Jiang, Samuel Tan, Stephen A. Vavasis:
Re-embedding data to strengthen recovery guarantees of clustering. CoRR abs/2301.10901 (2023) - 2022
- [j45]Xuan Vinh Doan
, Stephen A. Vavasis:
Low-rank matrix recovery with Ky Fan 2-k-norm. J. Glob. Optim. 82(4): 727-751 (2022) - 2021
- [i24]Jimit Majmudar, Stephen A. Vavasis:
Robust Correlation Clustering with Asymmetric Noise. CoRR abs/2110.08385 (2021) - 2020
- [c17]Jimit Majmudar, Stephen A. Vavasis:
Provable Overlapping Community Detection in Weighted Graphs. NeurIPS 2020 - [i23]Jimit Majmudar, Stephen A. Vavasis:
Provable Overlapping Community Detection in Weighted Graphs. CoRR abs/2004.07150 (2020) - [i22]Tao Jiang, Stephen A. Vavasis:
On identifying clusters from sum-of-norms clustering computation. CoRR abs/2006.11355 (2020)
2010 – 2019
- 2019
- [c16]Xuan Vinh Doan, Stephen A. Vavasis:
Low-Rank Matrix Recovery with Ky Fan 2-k-Norm. WCGO 2019: 310-319 - [i21]Tao Jiang, Stephen A. Vavasis, Chen Wen Zhai:
Recovery of a mixture of Gaussians by sum-of-norms clustering. CoRR abs/1902.07137 (2019) - [i20]Stephen A. Vavasis, Katerina D. Papoulia, M. Reza Hirmand:
Second-order cone interior-point method for quasistatic and moderate dynamic cohesive fracture. CoRR abs/1909.10641 (2019) - 2018
- [j44]Nicolas Gillis
, Stephen A. Vavasis:
On the Complexity of Robust PCA and ℓ1-Norm Low-Rank Matrix Approximation. Math. Oper. Res. 43(4): 1072-1084 (2018) - 2017
- [j43]Sahar Karimi, Stephen A. Vavasis:
IMRO: A Proximal Quasi-Newton Method for Solving ℓ1-Regularized Least Squares Problems. SIAM J. Optim. 27(2): 583-615 (2017) - 2016
- [j42]Xuan Vinh Doan, Stephen A. Vavasis:
Finding the Largest Low-Rank Clusters With Ky Fan 2-k-Norm and ℓ1-Norm. SIAM J. Optim. 26(1): 274-312 (2016) - 2015
- [j41]Dmitriy Drusvyatskiy, Stephen A. Vavasis, Henry Wolkowicz:
Extreme point inequalities and geometry of the rank sparsity ball. Math. Program. 152(1-2): 521-544 (2015) - [j40]Nicolas Gillis
, Stephen A. Vavasis:
Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization. SIAM J. Optim. 25(1): 677-698 (2015) - [i19]Nicolas Gillis, Stephen A. Vavasis:
On the Complexity of Robust PCA and ℓ1-norm Low-Rank Matrix Approximation. CoRR abs/1509.09236 (2015) - 2014
- [j39]Shankar P. Sastry, Suzanne M. Shontz
, Stephen A. Vavasis:
A log-barrier method for mesh quality improvement and untangling. Eng. Comput. 30(3): 315-329 (2014) - [j38]Brendan P. W. Ames
, Stephen A. Vavasis:
Convex optimization for the planted k-disjoint-clique problem. Math. Program. 143(1-2): 299-337 (2014) - [j37]Nicolas Gillis
, Stephen A. Vavasis:
Fast and Robust Recursive Algorithmsfor Separable Nonnegative Matrix Factorization. IEEE Trans. Pattern Anal. Mach. Intell. 36(4): 698-714 (2014) - [i18]Laurent Jacques, Christophe De Vleeschouwer, Yannick Boursier, Prasad Sudhakar, C. De Mol, Aleksandra Pizurica, Sandrine Anthoine, Pierre Vandergheynst, Pascal Frossard, Cagdas Bilen, Srdan Kitic, Nancy Bertin, Rémi Gribonval, Nicolas Boumal, Bamdev Mishra, Pierre-Antoine Absil, Rodolphe Sepulchre, Shaun Bundervoet, Colas Schretter, Ann Dooms, Peter Schelkens, Olivier Chabiron, François Malgouyres, Jean-Yves Tourneret, Nicolas Dobigeon, Pierre Chainais, Cédric Richard, Bruno Cornelis, Ingrid Daubechies, David B. Dunson, Marie Danková, Pavel Rajmic, Kévin Degraux, Valerio Cambareri, Bert Geelen, Gauthier Lafruit, Gianluca Setti, Jean-François Determe, Jérôme Louveaux, François Horlin, Angélique Drémeau, Patrick Héas, Cédric Herzet, Vincent Duval, Gabriel Peyré, Alhussein Fawzi, Mike E. Davies, Nicolas Gillis, Stephen A. Vavasis, Charles Soussen, Luc Le Magoarou, Jingwei Liang, Jalal Fadili, Antoine Liutkus, David Martina, Sylvain Gigan, Laurent Daudet, Mauro Maggioni, Stanislav Minsker, Nate Strawn, C. Mory, Fred Maurice Ngolè Mboula, Jean-Luc Starck, Ignace Loris, Samuel Vaiter, Mohammad Golbabaee, Dejan Vukobratovic:
Proceedings of the second "international Traveling Workshop on Interactions between Sparse models and Technology" (iTWIST'14). CoRR abs/1410.0719 (2014) - 2013
- [j36]Xuan Vinh Doan, Stephen A. Vavasis:
Finding Approximately Rank-One Submatrices with the Nuclear Norm and 퓁1-Norm. SIAM J. Optim. 23(4): 2502-2540 (2013) - [j35]Xuan Vinh Doan, Kim-Chuan Toh, Stephen A. Vavasis:
A Proximal Point Algorithm for Sequential Feature Extraction Applications. SIAM J. Sci. Comput. 35(1) (2013) - [i17]Lisa Elkin, Ting Kei Pong, Stephen A. Vavasis:
Convex relaxation for finding planted influential nodes in a social network. CoRR abs/1307.4047 (2013) - [i16]Stephen A. Vavasis:
Some notes on applying computational divided differencing in optimization. CoRR abs/1307.4097 (2013) - [i15]Nicolas Gillis, Stephen A. Vavasis:
Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization. CoRR abs/1310.2273 (2013) - 2012
- [j34]Suzanne M. Shontz
, Stephen A. Vavasis:
A robust solution procedure for hyperelastic solids with large boundary deformation. Eng. Comput. 28(2): 135-147 (2012) - [i14]Nicolas Gillis, Stephen A. Vavasis:
Fast and Robust Recursive Algorithms for Separable Nonnegative Matrix Factorization. CoRR abs/1208.1237 (2012) - 2011
- [j33]Brendan P. W. Ames
, Stephen A. Vavasis:
Nuclear norm minimization for the planted clique and biclique problems. Math. Program. 129(1): 69-89 (2011) - [j32]Gun Srijuntongsiri
, Stephen A. Vavasis:
A Condition Number Analysis of an Algorithm for Solving a System of Polynomial Equations with One Degree of Freedom. SIAM J. Sci. Comput. 33(1): 433-454 (2011) - [c15]Shankar P. Sastry, Suzanne M. Shontz, Stephen A. Vavasis:
A Log-Barrier Method for Mesh Quality Improvement. IMR 2011: 329-346 - 2010
- [i13]Brendan P. W. Ames, Stephen A. Vavasis:
Convex optimization for the planted k-disjoint-clique problem. CoRR abs/1008.2814 (2010)
2000 – 2009
- 2009
- [j31]Stephen A. Vavasis:
On the Complexity of Nonnegative Matrix Factorization. SIAM J. Optim. 20(3): 1364-1377 (2009) - [c14]Gun Srijuntongsiri
, Stephen A. Vavasis:
Properties of Polynomial Bases Used in a Line-Surface Intersection Algorithm. PPAM (1) 2009: 369-378 - [r2]Stephen A. Vavasis:
Complexity Theory. Encyclopedia of Optimization 2009: 447-451 - [r1]Stephen A. Vavasis:
Complexity Theory: Quadratic Programming. Encyclopedia of Optimization 2009: 451-454 - [i12]Brendan P. W. Ames, Stephen A. Vavasis:
Nuclear norm minimization for the planted clique and biclique problems. CoRR abs/0901.3348 (2009) - 2008
- [j30]Erik G. Boman, Bruce Hendrickson, Stephen A. Vavasis:
Solving Elliptic Finite Element Systems in Near-Linear Time with Support Preconditioners. SIAM J. Numer. Anal. 46(6): 3264-3284 (2008) - [j29]Gun Srijuntongsiri
, Stephen A. Vavasis:
A Condition Number Analysis of a Line-Surface Intersection Algorithm. SIAM J. Sci. Comput. 30(2): 1064-1081 (2008) - [c13]Michael Biggs, Ali Ghodsi, Stephen A. Vavasis:
Nonnegative matrix factorization via rank-one downdate. ICML 2008: 64-71 - [i11]Michael Biggs, Ali Ghodsi, Stephen A. Vavasis:
Nonnegative Matrix Factorization via Rank-One Downdate. CoRR abs/0805.0120 (2008) - 2007
- [i10]Gun Srijuntongsiri, Stephen A. Vavasis:
Properties of polynomial bases used in a line-surface intersection algorithm. CoRR abs/0707.1515 (2007) - [i9]Stephen A. Vavasis:
On the complexity of nonnegative matrix factorization. CoRR abs/0708.4149 (2007) - [i8]Gun Srijuntongsiri, Stephen A. Vavasis:
A Condition Number Analysis of a Surface-Surface Intersection Algorithm. CoRR abs/0711.4656 (2007) - 2006
- [j28]Pritam Ganguly, Stephen A. Vavasis, Katerina D. Papoulia:
An Algorithm for Two-Dimensional Mesh Generation Based on the Pinwheel Tiling. SIAM J. Sci. Comput. 28(4): 1533-1562 (2006) - [i7]Gun Srijuntongsiri, Stephen A. Vavasis:
A Condition Number Analysis of a Line-Surface Intersection Algorithm. CoRR abs/cs/0608090 (2006) - [i6]Suzanne M. Shontz, Stephen A. Vavasis:
A Robust Solution Procedure for Hyperelastic Solids with Large Boundary Deformation. CoRR abs/cs/0609001 (2006) - 2005
- [j27]Guðbjörn F. Jónsson, Stephen A. Vavasis:
Accurate solution of polynomial equations using Macaulay resultant matrices. Math. Comput. 74(249): 221-262 (2005) - [j26]Victoria E. Howle, Stephen A. Vavasis:
An Iterative Method for Solving Complex-Symmetric Systems Arising in Electrical Power Modeling. SIAM J. Matrix Anal. Appl. 26(4): 1150-1178 (2005) - 2004
- [j25]Guðbjörn F. Jónsson, Stephen A. Vavasis:
Solving Polynomials with Small Leading Coefficients. SIAM J. Matrix Anal. Appl. 26(2): 400-414 (2004) - [c12]Pritam Ganguly, Stephen A. Vavasis, Katerina D. Papoulia:
An Algorithm for Two-Dimensional Mesh Generation Based on the Pinwheel Tiling. IMR 2004: 27-38 - [i5]Gun Srijuntongsiri, Stephen A. Vavasis:
A Fully Sparse Implementation of a Primal-Dual Interior-Point Potential Reduction Method for Semidefinite Programming. CoRR abs/cs/0412009 (2004) - [i4]Pritam Ganguly, Stephen A. Vavasis, Katerina D. Papoulia:
An algorithm for two-dimensional mesh generation based on the pinwheel tiling. CoRR cs.CG/0407018 (2004) - [i3]Erik G. Boman, Bruce Hendrickson, Stephen A. Vavasis:
Solving Elliptic Finite Element Systems in Near-Linear Time with Support Preconditioners. CoRR cs.NA/0407022 (2004) - [i2]Suzanne M. Shontz, Stephen A. Vavasis:
A linear weighted laplacian smoothing framework for warping tetrahedral meshes. CoRR cs.NA/0410045 (2004) - 2003
- [c11]L. Paul Chew, Nikos Chrisochoides, S. Gopalsamy, Gerd Heber, Anthony R. Ingraffea, Edward Luke, Joaquim B. Cavalcante Neto, Keshav Pingali, Alan M. Shih
, Bharat K. Soni, Paul Stodghill, David S. Thompson, Stephen A. Vavasis, Paul A. Wawrzynek:
Computational Science Simulations Based on Web Services. International Conference on Computational Science 2003: 299-308 - [c10]Suzanne M. Shontz, Stephen A. Vavasis:
A Mesh Warping Algorithm Based on Weighted Laplacian Smoothing. IMR 2003: 147-158 - [i1]Stephen A. Vavasis:
A Bernstein-Bezier Sufficient Condition for Invertibility of Polynomial Mapping Functions. CoRR cs.NA/0308021 (2003) - 2002
- [c9]L. Paul Chew, Stephen A. Vavasis, S. Gopalsamy, TzuYi Yu, Bharat K. Soni:
A Concise Representation of Geometry Suitable for Mesh Generation. IMR 2002: 275-283 - 2001
- [j24]Elena Y. Bobrovnikova, Stephen A. Vavasis:
Accurate Solution of Weighted Least Squares by Iterative Methods. SIAM J. Matrix Anal. Appl. 22(4): 1153-1174 (2001) - 2000
- [j23]Scott A. Mitchell, Stephen A. Vavasis:
Quality Mesh Generation in Higher Dimensions. SIAM J. Comput. 29(4): 1334-1370 (2000) - [c8]Bruce Carter, Chuin-Shan Chen, L. Paul Chew, Nikos Chrisochoides, Guang R. Gao, Gerd Heber, Anthony R. Ingraffea, Roland Krause, Chris Myers, Démian Nave, Keshav Pingali, Paul Stodghill, Stephen A. Vavasis, Paul A. Wawrzynek:
Parallel FEM Simulation of Crack Propagation - Challenges, Status, and Perspectives. IPDPS Workshops 2000: 443-449
1990 – 1999
- 1999
- [p1]Stephen A. Vavasis:
Convex Optimization. Algorithms and Theory of Computation Handbook 1999 - 1998
- [j22]Gary L. Miller, Shang-Hua Teng, William P. Thurston, Stephen A. Vavasis:
Geometric Separators for Finite-Element Meshes. SIAM J. Sci. Comput. 19(2): 364-386 (1998) - [j21]Tobin A. Driscoll
, Stephen A. Vavasis:
Numerical Conformal Mapping Using Cross-Ratios and Delaunay Triangulation. SIAM J. Sci. Comput. 19(6): 1783-1803 (1998) - 1997
- [j20]Gary L. Miller, Shang-Hua Teng, William P. Thurston, Stephen A. Vavasis:
Separators for sphere-packings and nearest neighbor graphs. J. ACM 44(1): 1-29 (1997) - [j19]Patricia D. Hough, Stephen A. Vavasis:
Complete Orthogonal Decomposition for Weighted Least Squares. SIAM J. Matrix Anal. Appl. 18(2): 369-392 (1997) - 1996
- [j18]Stephen A. Vavasis, Yinyu Ye:
Identifying an optimal basis in linear programming. Ann. Oper. Res. 62(1): 565-572 (1996) - [j17]Stephen A. Vavasis, Yinyu Ye:
A primal-dual interior point method whose running time depends only on the constraint matrix. Math. Program. 74: 79-120 (1996) - [c7]Scott A. Mitchell, Stephen A. Vavasis:
An Aspect Ratio Bound for Triangulating a d-Grid Cut by a Hyperplane (Extended Abstract). SCG 1996: 48-57 - 1995
- [j16]Stephen A. Vavasis:
Book review. J. Glob. Optim. 6(1): 107-108 (1995) - [j15]Stephen A. Vavasis, Yinyu Ye:
Condition numbers for polyhedra with real number data. Oper. Res. Lett. 17(5): 209-214 (1995) - 1994
- [j14]Stephen A. Vavasis:
Software section. J. Glob. Optim. 5(2): 203-204 (1994) - [j13]Stephen A. Vavasis:
Stable Numerical Algorithms for Equilibrium Systems. SIAM J. Matrix Anal. Appl. 15(4): 1108-1131 (1994) - [c6]Stephen A. Vavasis, Yinyu Ye:
An accelerated interior point method whose running time depends only on A (extended abstract). STOC 1994: 512-521 - 1993
- [j12]Stephen A. Vavasis:
Black-Box Complexity of Local Minimization. SIAM J. Optim. 3(1): 60-80 (1993) - [j11]Julio Michael Stern
, Stephen A. Vavasis:
Nested Dissection for Sparse Nullspace Bases. SIAM J. Matrix Anal. Appl. 14(3): 766-775 (1993) - 1992
- [j10]Stephen A. Vavasis:
Local minima for indefinite quadratic knapsack problems. Math. Program. 54: 127-153 (1992) - [j9]Stephen A. Vavasis:
Approximation algorithms for indefinite quadratic programming. Math. Program. 57: 279-311 (1992) - [j8]Panos M. Pardalos, Stephen A. Vavasis:
Open questions in complexity theory for numerical optimization. Math. Program. 57: 337-339 (1992) - [j7]Stephen A. Vavasis:
Preconditioning for Boundary Integral Equations. SIAM J. Matrix Anal. Appl. 13(3): 905-925 (1992) - [c5]Scott A. Mitchell, Stephen A. Vavasis:
Quality Mesh Generation in Three Dimensions. SCG 1992: 212-221 - 1991
- [j6]Panos M. Pardalos, Stephen A. Vavasis:
Quadratic programming with one negative eigenvalue is NP-hard. J. Glob. Optim. 1(1): 15-22 (1991) - [j5]Jorge J. Moré, Stephen A. Vavasis:
On the solution of concave knapsack problems. Math. Program. 49: 397-411 (1991) - [j4]Stephen A. Vavasis:
Automatic Domain Partitioning in Three Dimensions. SIAM J. Sci. Comput. 12(4): 950-970 (1991) - [c4]Gary L. Miller, Shang-Hua Teng, Stephen A. Vavasis:
A Unified Geometric Approach to Graph Separators. FOCS 1991: 538-547 - [c3]Gary L. Miller, Stephen A. Vavasis:
Density Graphs and Separators. SODA 1991: 331-336 - 1990
- [j3]Stephen A. Vavasis:
Quadratic Programming is in NP. Inf. Process. Lett. 36(2): 73-77 (1990)
1980 – 1989
- 1989
- [b1]Stephen A. Vavasis:
Complexity of fixed point computations. Stanford University, USA, 1989 - [j2]Michael D. Hirsch, Christos H. Papadimitriou, Stephen A. Vavasis:
Exponential lower bounds for finding Brouwer fix points. J. Complex. 5(4): 379-416 (1989) - [j1]Stephen A. Vavasis:
Gaussian Elimination with Pivoting is P-Complete. SIAM J. Discret. Math. 2(3): 413-423 (1989) - 1987
- [c2]Michael D. Hirsch, Stephen A. Vavasis:
Exponential Lower Bounds for Finding Brouwer Fixed Points (Extended Abstract). FOCS 1987: 401-410 - 1983
- [c1]Karl J. Lieberherr, Stephen A. Vavasis:
Analysis of polynomial approximation algorithms for constraint expressions. Theoretical Computer Science 1983: 187-197
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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-07-17 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint