No label defined (Q5054600)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7625166

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7625166

Statements

scholarly article

0 references

Ryan Cory-Wright

0 references

0 references

Dimitris J. Bertsimas

0 references

publication date

29 November 2022

0 references

full work available at URL

https://arxiv.org/abs/2005.05195

0 references

https://jmlr.csail.mit.edu/papers/v23/20-1188.html

0 references

zbMATH Keywords

sparse PCA

0 references

sparse eigenvalues

0 references

semidefinite optimization

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization

0 references

High-dimensional analysis of semidefinite relaxations for sparse principal components

0 references

Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons

0 references

Rounding sum-of-squares relaxations

0 references

Branch-and-Price: Column Generation for Solving Huge Integer Programs

0 references

On Tractable Approximations of Uncertain Linear Matrix Inequalities Affected by Interval Uncertainty

0 references

Certifiably optimal sparse principal component analysis

0 references

Optimal detection of sparse principal components in high dimension

0 references

On polyhedral and second-order cone decompositions of semidefinite optimization problems

0 references

Sparse high-dimensional regression: exact scalable algorithms and phase transitions

0 references

0 references

A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints

0 references

Sparse classification: a scalable discrete optimization perspective

0 references

On factor width and symmetric \(H\)-matrices

0 references

Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices

0 references

0 references

Linear Matrix Inequalities in System and Control Theory

0 references

Limits for the characteristic roots of a matrix. IV. Applications to stochastic matrices

0 references

The difference between \(5\times 5\) doubly nonnegative and completely positive matrices

0 references

The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).

0 references

0 references

A fast, provably accurate approximation algorithm for sparse principal component analysis reveals human genetic variation across the world

0 references

0 references

Solving sparse principal component analysis with global support

0 references

Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA

0 references

Separating doubly nonnegative and completely positive matrices

0 references

An outer-approximation algorithm for a class of mixed-integer nonlinear programs

0 references

Approximation bounds for sparse principal component analysis

0 references

A framework for solving mixed-integer semidefinite programs

0 references

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

0 references

0 references

Generalized power method for sparse principal component analysis

0 references

The varimax criterion for analytic rotation in factor analysis

0 references

Second order cone programming relaxation of nonconvex quadratic optimization problems

0 references

A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems

0 references

A well-conditioned estimator for large-dimensional covariance matrices

0 references

Doubly diagonally dominant matrices

0 references

Clustering and feature selection using sparse principal component analysis

0 references

Conditional Gradient Algorithmsfor Rank-One Matrix Approximations with a Sparsity Constraint

0 references

NP-hardness and inapproximability of sparse PCA

0 references

Randomized rounding: A technique for provably good algorithms and algorithmic proofs

0 references

Graph expansion and the unique games conjecture

0 references

Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization

0 references

On max-\(k\)-sums

0 references

Statistical and computational trade-offs in estimation of sparse principal components

0 references

A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis

0 references

Handbook of semidefinite programming. Theory, algorithms, and applications

0 references

0 references

Optimization of demand response through peak shaving

0 references

Sparse PCA: Convex Relaxations, Algorithms and Applications

0 references

Identifiers

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5054600

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5054600&oldid=37465884"