Sparse Approximate Solutions to Semidefinite Programs

No abstract is available for this paper.

• Publication year

  2008

• Venue

  Latin American Symposium on Theoretical Informatics

• Publication date

  2008-04-07

• Fields of study

  Mathematics, Physics, Computer Science

• Identifiers
  DOI 10.1007/978-3-540-78773-0_27
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm

  2008cited by this paper
• The learnability of quantum states

  2006cited by this paper
• Fast algorithms for approximate semidefinite programming using the multiplicative weights update method

  2005cited by this paper
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization

  1995cited by this paper
• Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints

  1994cited by this paper
• Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start

  1992cited by this paper
• Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start

  1992influential reference
• An algorithm for quadratic programming

  1956influential reference

• A Randomized Linearly Convergent Frank-Wolfe-type Method for Smooth Convex Minimization over the Spectrahedron

  2025cites this paper
• Simplex Frank-Wolfe: Linear Convergence and Its Numerical Efficiency for Convex Optimization over Polytopes

  2025cites this paper
• Beyond the Ideal: Analyzing the Inexact Muon Update

  2025cites this paper
• A low-rank augmented Lagrangian method for large-scale semidefinite programming based on a hybrid convex-nonconvex approach

  2024cites this paper
• Chain of LoRA: Efficient Fine-tuning of Language Models via Residual Learning

  2024cites this paper
• Suboptimality bounds for trace-bounded SDPs enable a faster and scalable low-rank SDP solver SDPLR+

  2024cites this paper
• Efficient Duple Perturbation Robustness in Low-rank MDPs

  2024cites this paper
• Federated Frank-Wolfe Algorithm

  2024cites this paper
• Continuum topological derivative - a novel application tool for denoising CT and MRI medical images

  2024cites this paper
• Online Convex Optimization with a Separation Oracle

  2024cites this paper
• A Parameter-Free Conditional Gradient Method for Composite Minimization under Hölder Condition

  2023cites this paper
• Infinite Lewis Weights in Spectral Graph Theory

  2023cites this paper
• Dynamic Regret of Distributed Online Frank-Wolfe Convex Optimization

  2023cites this paper
• Nonsmooth projection-free optimization with functional constraints

  2023cites this paper
• Improved dynamic regret of distributed online multiple Frank-Wolfe convex optimization

  2023cites this paper
• Exploiting the Curvature of Feasible Sets for Faster Projection-Free Online Learning

  2022cites this paper
• Stochastic Frank-Wolfe for Composite Convex Minimization

  2022cites this paper
• Open Journal of Mathematical Optimization

  2022cites this paper
• Open Journal of Mathematical Optimization

  2022cites this paper
• Open Journal of Mathematical Optimization

  2022cites this paper
• Convex and Nonconvex Approaches for the Matrix Completion Problem

  2022cites this paper
• Illinois-Type Methods for Noisy Euclidean Distance Realization

  2022cites this paper
• A Semismooth Newton-based Augmented Lagrangian Algorithm for Density Matrix Least Squares Problems

  2022cites this paper
• Quantum State Tomography via Nonconvex Riemannian Gradient Descent.

  2022cites this paper
• Parabolic Relaxation for Quadratically-constrained Quadratic Programming - Part II: Theoretical & Computational Results

  2022cites this paper
• Frank-Wolfe-based Algorithms for Approximating Tyler's M-estimator

  2022cites this paper
• Distributed stochastic projection-free solver for constrained optimization

  2022cites this paper
• Q-FW: A Hybrid Classical-Quantum Frank-Wolfe for Quadratic Binary Optimization

  2022cites this paper
• The Iterates of the Frank-Wolfe Algorithm May Not Converge

  2022cites this paper
• From Online Optimization to PID Controllers: Mirror Descent with Momentum

  2022influential citation
• Projection-free Distributed Online Learning with Strongly Convex Losses

  2021cites this paper
• Complexity of Linear Minimization and Projection on Some Sets

  2021cites this paper
• Automated Machine Learning for Multimedia

  2021cites this paper
• Ergodic Limits, Relaxations, and Geometric Properties of Random Walk Node Embeddings

  2021cites this paper
• Screening for a Reweighted Penalized Conditional Gradient Method

  2021cites this paper
• A Cutting-plane Method for Semidefinite Programming with Potential Applications on Noisy Quantum Devices

  2021cites this paper
• Conditional gradient methods for stochastically constrained convex minimization

  2020cites this paper
• Memory-Efficient Structured Convex Optimization via Extreme Point Sampling

  2020cites this paper
• Self-concordant analysis of Frank-Wolfe algorithms

  2020influential citation
• Conditional Gradient Methods for Convex Optimization with General Affine and Nonlinear Constraints

  2020cites this paper
• A Newton Frank–Wolfe method for constrained self-concordant minimization

  2020cites this paper
• Safe Screening for the Generalized Conditional Gradient Method

  2020cites this paper
• Faster Projection-free Online Learning

  2020cites this paper
• Estimation of the parameters of a weighted nuclear norm model and its application in image denoising

  2020cites this paper
• Frank-Wolfe Methods with an Unbounded Feasible Region and Applications to Structured Learning

  2020cites this paper
• Conditional Gradient Methods for Convex Optimization with Function Constraints

  2020cites this paper
• Projection-Free Methods

  2020cites this paper
• Projection-free Online Learning over Strongly Convex Sets

  2020cites this paper
• Fully Projection-Free Proximal Stochastic Gradient Method With Optimal Convergence Rates

  2020influential citation
• An Õ(m/ε)-Cost Algorithm for Semidefinite Programs with Diagonal Constraints

  2020cites this paper
• Stochastic Frank-Wolfe for Composite Convex Minimization

  2019cites this paper
• An $\widetilde{\mathcal{O}}(m/\varepsilon^{3.5})$-Cost Algorithm for Semidefinite Programs with Diagonal Constraints

  2019cites this paper
• An Optimal-Storage Approach to Semidefinite Programming using Approximate Complementarity

  2019cites this paper
• On the Convergence of Projected-Gradient Methods with Low-Rank Projections for Smooth Convex Minimization over Trace-Norm Balls and Related Problems

  2019cites this paper
• Stochastic Conditional Gradient Method for Composite Convex Minimization

  2019influential citation
• Scalable Semidefinite Programming

  2019cites this paper
• Efficient Projection-Free Online Methods with Stochastic Recursive Gradient

  2019cites this paper
• Stochastic Recursive Gradient-Based Methods for Projection-Free Online Learning

  2019cites this paper
• On sparse sensor placement for parameter identification problems with partial differential equations

  2019cites this paper
• A Survey of Recent Scalability Improvements for Semidefinite Programming with Applications in Machine Learning, Control, and Robotics

  2019influential citation
• A condition under which classical simulability implies efficient state learnability

  2019cites this paper
• Conditional Gradient Methods via Stochastic Path-Integrated Differential Estimator

  2019influential citation
• Robust Factorization Machine: A Doubly Capped Norms Minimization

  2019cites this paper
• Frank-Wolfe Method is Automatically Adaptive to Error Bound Condition

  2018cites this paper
• ℓ2, 1-ℓ1 regularized nonlinear multi-task representation learning based cognitive performance prediction of Alzheimer's disease

  2018cites this paper
• Smoothed analysis for low-rank solutions to semidefinite programs in quadratic penalty form

  2018cites this paper
• Frank-Wolfe Style Algorithms for Large Scale Optimization

  2018cites this paper
• Smoothed analysis of the low-rank approach for smooth semidefinite programs

  2018cites this paper
• Optimization Methods for Semi-Supervised Learning

  2018cites this paper
• A Conditional Gradient Framework for Composite Convex Minimization with Applications to Semidefinite Programming

  2018cites this paper
• L G ] 1 6 A pr 2 01 4 ORTHOGONAL RANK-ONE MATRIX PURSUIT FOR LOW RANK MATRIX COMPLETION

  2018cites this paper
• Provable compressed sensing quantum state tomography via non-convex methods

  2018cites this paper
• Stabiliser states are efficiently PAC-learnable

  2017cites this paper
• Linear Convergence of a Frank-Wolfe Type Algorithm over Trace-Norm Balls

  2017cites this paper
• Clustering is semidefinitely not that hard: Nonnegative SDP for manifold disentangling

  2017influential citation
• Conditional Accelerated Lazy Stochastic Gradient Descent

  2017influential citation
• Experimental learning of quantum states

  2017cites this paper
• Provable quantum state tomography via non-convex methods

  2017influential citation
• Sketchy Decisions: Convex Low-Rank Matrix Optimization with Optimal Storage

  2017cites this paper
• Generalized reduced rank latent factor regression for high dimensional tensor fields, and neuroimaging‐genetic applications

  2017cites this paper
• Convex Factorization Machine for Toxicogenomics Prediction

  2017cites this paper
• A distributed Frank–Wolfe framework for learning low-rank matrices with the trace norm

  2017cites this paper
• Riemannian Submanifold Tracking on Low-Rank Algebraic Variety

  2017cites this paper
• SVD-free Convex-Concave Approaches for Nuclear Norm Regularization

  2017cites this paper
• Incremental Matrix Factorization: A Linear Feature Transformation Perspective

  2017cites this paper
• Nonsmooth Optimization for Statistical Learning with Structured Matrix Regularization. (Optimisation non-lisse pour l'apprentissage statistique avec avec régularisation matricielle structurée)

  2017cites this paper
• Should You Derive, Or Let the Data Drive? An Optimization Framework for Hybrid First-Principles Data-Driven Modeling

  2017cites this paper
• A Stochastic Sub-gradient Method for Low Rank Matrix Completion of Collaborative Recommendation

  2017cites this paper
• Convex Latent Modeling

  2017cites this paper
• Minimum Rank Positive Semidefinite Matrix Completion with Chordal Sparsity Pattern

  2017cites this paper
• Proximal Riemannian Pursuit for Large-Scale Trace-Norm Minimization

  2016cites this paper
• Pursuits in Structured Non-Convex Matrix Factorizations

  2016influential citation
• The 54th Annual Meeting of the Association for Computational Linguistics

  2016cites this paper
• Methods for convex optimization and statistical learning

  2016influential citation
• A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization

  2016influential citation
• Greedy Optimization and Applications to Structured Tensor Factorizations

  2016cites this paper
• Dynamic Assortment Personalization in High Dimensions

  2016cites this paper
• Which Tumblr Post Should I Read Next?

  2016influential citation
• Learning Protein Dynamics with Metastable Switching Systems

  2016cites this paper
• Faster Projection-free Convex Optimization over the Spectrahedron

  2016cites this paper