Low-Rank Semidefinite Programming: Theory and Applications

No abstract is available for this paper.

• Publication year

  2016

• Venue

  Found. Trends Optim.

• Publication date

  2016-05-04

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1561/2400000009
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Linear And Nonlinear Programming

  2016cited by this paper
• Low-complexity robust MISO downlink precoder optimization for the limited feedback case

  2015cited by this paper
• On Robust Optimization

  2015cited by this paper
• Lambert-W Function

  2015cited by this paper
• Polynomial Solvability of Variants of the Trust-Region Subproblem

  2014cited by this paper
• The trust region subproblem with non-intersecting linear constraints

  2014cited by this paper
• Efficient convex relaxation for stochastic optimal distributed control problem

  2014cited by this paper
• S-lemma with equality and its applications

  2014cited by this paper
• On the exactness of semidefinite relaxation for nonlinear optimization over graphs: Part I

  2013cited by this paper
• Tightness of Semidefinite Programming Relaxation to Robust Transmit Beamforming with SINR Constraints

  2013cited by this paper
• Second-Order-Cone Constraints for Extended Trust-Region Subproblems

  2013influential reference
• Generalized S-Lemma and strong duality in nonconvex quadratic programming

  2012cited by this paper
• Physics of power networks makes hard optimization problems easy to solve

  2012cited by this paper
• Geometry of power flows in tree networks

  2012cited by this paper
• Quadratically Constrained Quadratic Programs on Acyclic Graphs With Application to Power Flow

  2012cited by this paper
• Zero Duality Gap in Optimal Power Flow Problem

  2012cited by this paper
• Compressed Sensing

  2012cited by this paper
• Zero duality gap for classical opf problem convexifies fundamental nonlinear power problems

  2011cited by this paper
• Robust SINR-constrained MISO downlink beamforming: when is semidefinite programming relaxation tight?

  2011cited by this paper
• Worst-case robust multiuser transmit beamforming using semidefinite relaxation: duality and implications

  2011cited by this paper
• Optimal charging of plug-in hybrid electric vehicles in smart grids

  2011cited by this paper
• Geometry of injection regions of power networks

  2011cited by this paper
• Convex Optimization-based Beamforming : From Receive to Transmit and Network Designs

  2010cited by this paper
• Introduction to linear Algebra

  2010cited by this paper
• Convex Optimization-Based Beamforming

  2010cited by this paper
• Optimal and Robust Transmit Designs for MISO Channel Secrecy by Semidefinite Programming

  2010cited by this paper
• Rank-Constrained Separable Semidefinite Programming With Applications to Optimal Beamforming

  2010cited by this paper
• Analysis and Control of Nonlinear Systems: A Flatness-based Approach

  2009cited by this paper
• Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization

  2009cited by this paper
• Robust QoS-Constrained Optimization of Downlink Multiuser MISO Systems

  2009cited by this paper
• A Simple Proof of the Restricted Isometry Property for Random Matrices

  2008cited by this paper
• A Unified Theorem on SDP Rank Reduction

  2008cited by this paper
• On the Low Rank Solutions for Linear Matrix Inequalities

  2008cited by this paper
• Low-Rank Optimization on the Cone of Positive Semidefinite Matrices

  2008cited by this paper
• A Survey of the S-Lemma

  2007cited by this paper
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization

  2007cited by this paper
• Valid inequalities for mixed integer linear programs

  2007cited by this paper
• Complex Matrix Decomposition and Quadratic Programming

  2007cited by this paper
• Revival of the Gomory cuts in the 1990’s

  2007cited by this paper
• Convex Conic Formulations of Robust Downlink Precoder Designs With Quality of Service Constraints

  2007cited by this paper
• Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints

  2006cited by this paper
• Kalman-Popov-Yakubovich lemma and the S-procedure: A historical essay

  2006cited by this paper
• Sparsity and incoherence in compressive sampling

  2006cited by this paper
• Local Minima and Convergence in Low-Rank Semidefinite Programming

  2005cited by this paper
• Decoding by linear programming

  2005cited by this paper
• Stable signal recovery from incomplete and inaccurate measurements

  2005cited by this paper
• Optimal inapproximability results for MAX-CUT and other 2-variable CSPs?

  2004cited by this paper
• On Cones of Nonnegative Quadratic Functions

  2003cited by this paper
• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization

  2003cited by this paper
• Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices

  2003cited by this paper
• First- and second-order methods for semidefinite programming

  2003cited by this paper
• A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs

  2003cited by this paper
• New Results on Quadratic Minimization

  2003cited by this paper
• Exact Solutions of Some Nonconvex Quadratic Optimization Problems via SDP and SOCP Relaxations

  2003cited by this paper
• On the power of unique 2-prover 1-round games

  2002cited by this paper
• Interior-Point Algorithms for Semidefinite Programming Based on a Nonlinear Formulation

  2002cited by this paper
• Semidefinite programming

  2002cited by this paper
• A projected gradient algorithm for solving the maxcut SDP relaxation

  2001cited by this paper
• Some optimal inapproximability results

  2001cited by this paper
• A rank minimization heuristic with application to minimum order system approximation

  2001cited by this paper
• A Remark on the Rank of Positive Semidefinite Matrices Subject to Affine Constraints

  2001cited by this paper
• ADAPTIVE ESTIMATION OF A QUADRATIC FUNCTIONAL BY MODEL SELECTION

  2001cited by this paper
• Practical Methods of Optimization: Fletcher/Practical Methods of Optimization

  2000cited by this paper
• Matrix Analysis and Applied Linear Algebra

  2000cited by this paper
• On the semi-definite programming solution of the least order dynamic output feedback synthesis

  1999cited by this paper
• A Spectral Bundle Method for Semidefinite Programming

  1999cited by this paper
• Solving the Trust-Region Subproblem using the Lanczos Method

  1999cited by this paper
• On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues

  1998cited by this paper
• A semidefinite framework for trust region subproblems with applications to large scale minimization

  1997cited by this paper
• Quality of semidefinite relaxation for nonconvex quadratic optimization

  1997cited by this paper
• Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints

  1997cited by this paper
• Gadgets, approximation, and linear programming

  1996cited by this paper
• Problems of distance geometry and convex properties of quadratic maps

  1995cited by this paper
• Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations

  1995cited by this paper
• A trust-region strategy for minimization on arbitrary domains

  1995cited by this paper
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

  1995cited by this paper
• Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres

  1994cited by this paper
• Convergence behavior of interior-point algorithms

  1993cited by this paper
• On affine scaling algorithms for nonconvex quadratic programming

  1992cited by this paper
• Computing a Celis-Dennis-Tapia trust-region step for equality constrained optimization

  1992cited by this paper
• An interior point algorithm to solve computationally difficult set covering problems

  1991cited by this paper
• A robust trust region algorithm for nonlinear programming

  1990cited by this paper
• Analysis and control of nonlinear systems

  1988cited by this paper
• Computing a Trust Region Step

  1983cited by this paper
• Numerical methods for unconstrained optimization and nonlinear equations

  1983cited by this paper
• Newton's method with a model trust region modification

  1982cited by this paper
• The NP-Completeness Column: An Ongoing Guide

  1982influential reference
• Computing Optimal Locally Constrained Steps

  1981cited by this paper
• The Levenberg-Marquardt algo-rithm: Implementation and theory

  1977cited by this paper
• Complexity of Computer Computations

  1972cited by this paper
• A New Approach to Variable Metric Algorithms

  1970cited by this paper
• The Convergence of a Class of Double-rank Minimization Algorithms 2. The New Algorithm

  1970cited by this paper
• The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations

  1970cited by this paper
• Conditioning of Quasi-Newton Methods for Function Minimization

  1970cited by this paper
• A family of variable-metric methods derived by variational means

  1970cited by this paper
• A method for nonlinear constraints in minimization problems

  1969cited by this paper
• Multiplier and gradient methods

  1969cited by this paper
• Maximization by Quadratic Hill-Climbing

  1966cited by this paper
• AN ALGORITHM FOR THE MIXED INTEGER PROBLEM

  1960cited by this paper
• An algorithm for integer solutions to linear programs

  1958cited by this paper

• Two-parameter families of MPO integrals of motion in Heisenberg spin chains

  2026cites this paper
• A Dual Riemannian ADMM Algorithm for Low-Rank SDPs with Unit Diagonal

  2025cites this paper
• Opportunistic Scheduling With Beam Focusing in Distributed RIS-Aided MU-MIMO Systems

  2025cites this paper
• Cuts and semidefinite liftings for the complex cut polytope

  2024cites this paper
• Few-shot Multi-Task Learning of Linear Invariant Features with Meta Subspace Pursuit

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

  2024cites this paper
• Theoretical bounds on the network community profile from low-rank semi-definite programming

  2023cites this paper
• Motion Parameter Estimation for Mobile Sources Using Semidefinite Programming

  2023cites this paper
• Scalable Approximate Optimal Diagonal Preconditioning

  2023cites this paper
• Global minimization of polynomial integral functionals

  2023cites this paper
• Optimized Dimensionality Reduction for Moment-Based Distributionally Robust Optimization

  2023cites this paper
• Burer-Monteiro ADMM for Large-scale SDPs

  2023cites this paper
• Rank-constrained Hyperbolic Programming

  2022cites this paper
• The Riemannian Elevator for certifiable distance-based localization

  2022cites this paper
• Three-Dimensional Cooperative Positioning for Internet of Things Provenance

  2022cites this paper
• Inference and Optimization for Engineering and Physical Systems

  2022cites this paper
• Parabolic Relaxation for Quadratically-constrained Quadratic Programming - Part I: Definitions & Basic Properties

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

  2022cites this paper
• Robust Adaptive Beamforming via Worst-Case SINR Maximization With Nonconvex Uncertainty Sets

  2022cites this paper
• An augmented Lagrangian method for optimization problems with structured geometric constraints

  2021cites this paper
• A penalty decomposition algorithm with greedy improvement for mean-reverting portfolios with sparsity and volatility constraints

  2021cites this paper
• A strengthened Barvinok-Pataki bound on SDP rank

  2021cites this paper
• Rank-One Semidefinite Programming Solutions for Mobile Source Localization in Sensor Networks

  2021cites this paper
• Optimizing a Secure Two-Way Network with Non-Linear SWIPT, Channel Uncertainty, and a Hidden Eavesdropper

  2020cites this paper
• Symmetric Grothendieck inequality

  2020cites this paper
• Enhancing low-rank solutions in semidefinite relaxations of Boolean quadratic problems

  2020influential citation
• On the Tightness of Semidefinite Relaxations for Certifying Robustness to Adversarial Examples

  2020cites this paper
• An Intelligent Prediction System for Mobile Source Localization Using Time Delay Measurements

  2020cites this paper
• Distribution System State Estimation: A Semidefinite Programming Approach

  2019cites this paper
• Integral Quadratic Constraints: Exact Convergence Rates and Worst-Case Trajectories

  2019cites this paper
• A Relaxed Interior Point Method for Low-Rank Semidefinite Programming Problems with Applications to Matrix Completion

  2019cites this paper
• Omnidirectional Precoding for Massive MIMO With Uniform Rectangular Array—Part II: Numerical Optimization Based Schemes

  2019cites this paper
• Efficient Low-Rank Semidefinite Programming With Robust Loss Functions

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

  2019cites this paper
• An Optimality Gap Test for a Semidefinite Relaxation of a Quadratic Program with Two Quadratic Constraints

  2019cites this paper
• Optimal Lyapunov-Based Reaching Time Bounds for the Super-Twisting Algorithm

  2019cites this paper
• Efficient Semidefinite Programming with Approximate ADMM

  2019cites this paper
• A Triangle Algorithm for Semidefinite Version of Convex Hull Membership Problem

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

  2019cites this paper
• A Survey of Hidden Convex Optimization

  2019cites this paper
• Regularisers in Semidefinite Programming

  2018influential citation
• REACHING A TARGET WITHIN A GPS-DENIED OR COSTLY AREA: A TWO-STAGE OPTIMAL CONTROL APPROACH

  2018cites this paper
• Rank Optimality for the Burer-Monteiro Factorization

  2018cites this paper
• Robust Ordinal Embedding from Contaminated Relative Comparisons

  2018cites this paper
• Entropy-Penalized Semidefinite Programming

  2018cites this paper
• Omnidirectional Transmit Beamforming for Massive MIMO with Uniform Rectangular Array

  2018cites this paper
• Stabilizability of Discrete-Time Controlled Switched Linear Systems

  2018cites this paper
• Optimal Sensor Collaboration for Parameter Tracking Using Energy Harvesting Sensors

  2018cites this paper
• Introduction to Nonnegative Matrix Factorization

  2017cites this paper
• Phase Retrieval , What ’ s New ?

  2017cites this paper
• General Heuristics for Nonconvex Quadratically Constrained Quadratic Programming

  2017cites this paper
• Efficient rank minimization to tighten semidefinite programming for unconstrained binary quadratic optimization

  2017influential citation
• Auxetic deformations and elliptic curves

  2016cites this paper
• Unraveling the Rank-One Solution Mystery of Robust MISO Downlink Transmit Optimization: A Verifiable Sufficient Condition via a New Duality Result

  2016cites this paper
• Non-convex Optimization with Input Convex Neural Network as Optimality Guarantee

  year unknowncites this paper
• Neural Network Optimality Certificates for Non-Convex Optimization

  year unknowncites this paper