The following pages link to CVX (Q16765):
Displaying 50 items.
- Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications (Q1740163) (← links)
- Semidefinite approximations of the matrix logarithm (Q1740571) (← links)
- Efficient histogram dictionary learning for text/image modeling and classification (Q1741297) (← links)
- A domain decomposition Fourier continuation method for enhanced \(L_1\) regularization using sparsity of edges in reconstructing Fourier data (Q1742671) (← links)
- Analytical synthesis of robust controllers of the given accuracy under external perturbations (Q1743091) (← links)
- Solving fractional multicriteria optimization problems with sum of squares convex polynomial data (Q1743539) (← links)
- A novel approach for ellipsoidal outer-approximation of the intersection region of ellipses in the plane (Q1744887) (← links)
- Optimal attacks on qubit-based quantum key recycling (Q1746889) (← links)
- The inverse eigenvalue problem for entanglement witnesses (Q1747278) (← links)
- Constrained minimum variance control for discrete-time stochastic linear systems (Q1749425) (← links)
- A semidefinite programming method for integer convex quadratic minimization (Q1749779) (← links)
- Robust sparse signal reconstructions against basis mismatch and their applications (Q1749812) (← links)
- Quantile hedging in a semi-static market with model uncertainty (Q1750394) (← links)
- Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint (Q1753128) (← links)
- An interdiction game on a queueing network with multiple intruders (Q1753530) (← links)
- The Russell measure model: computational aspects, duality, and profit efficiency (Q1754336) (← links)
- Real zero polynomials and A. Horn's problem (Q1754431) (← links)
- Quadratic convex reformulation for quadratic programming with linear on-off constraints (Q1755375) (← links)
- Stochastic geometric optimization with joint probabilistic constraints (Q1755848) (← links)
- Low-rank matrix completion using nuclear norm minimization and facial reduction (Q1756746) (← links)
- Maximum-entropy sampling and the Boolean quadric polytope (Q1756791) (← links)
- Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers (Q1756794) (← links)
- Templates for convex cone problems with applications to sparse signal recovery (Q1762456) (← links)
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone (Q1785193) (← links)
- Alternating direction method of multipliers for truss topology optimization with limited number of nodes: a cardinality-constrained second-order cone programming approach (Q1787322) (← links)
- On solving quadratically constrained quadratic programming problem with one non-convex constraint (Q1790405) (← links)
- Sparse feedback design in discrete-time linear systems (Q1792585) (← links)
- Quadratic stabilization of discrete-time bilinear systems (Q1792588) (← links)
- A new conic approach to semisupervised support vector machines (Q1793456) (← links)
- Speeding up finite-time consensus via minimal polynomial of a weighted graph -- a numerical approach (Q1797040) (← links)
- Practical matrix completion and corruption recovery using proximal alternating robust subspace minimization (Q1799934) (← links)
- An efficient second-order cone programming approach for optimal selection in tree breeding (Q1800455) (← links)
- Polyhedral approximation in mixed-integer convex optimization (Q1800994) (← links)
- A stochastic control formalism for dynamic biologically conformal radiation therapy (Q1926672) (← links)
- Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs (Q1926817) (← links)
- Shape-based object detection via boundary structure segmentation (Q1931604) (← links)
- On solving biquadratic optimization via semidefinite relaxation (Q1935575) (← links)
- NP-hardness of deciding convexity of quartic polynomials and related problems (Q1942256) (← links)
- Generalized locality preserving maxi-min margin machine (Q1942712) (← links)
- Recognizing interactive group activities using temporal interaction matrices and their Riemannian statistics (Q1943421) (← links)
- Variable selection of varying coefficient models in quantile regression (Q1950855) (← links)
- Robust regression through the Huber's criterion and adaptive lasso penalty (Q1952217) (← links)
- Two proposals for robust PCA using semidefinite programming (Q1952221) (← links)
- An efficient approach to solve the large-scale semidefinite programming problems (Q1955162) (← links)
- Design of 2D linear phase DFT modulated filter banks using bi-iterative second-order cone program (Q1957901) (← links)
- Exact matrix completion based on low rank Hankel structure in the Fourier domain (Q1979919) (← links)
- S-matrix bootstrap in 3 + 1 dimensions: regularization and dual convex problem (Q1980666) (← links)
- Optimal Runge-Kutta stability polynomials for multidimensional high-order methods (Q1983563) (← links)
- Side-information-induced reweighted sparse subspace clustering (Q1983683) (← links)
- A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials (Q1984696) (← links)
