The following pages link to CVX (Q16765):
Displaying 50 items.
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041) (← links)
- Best linear estimation via minimization of relative mean squared error (Q2329747) (← links)
- T-optimal designs for multi-factor polynomial regression models via a semidefinite relaxation method (Q2329795) (← links)
- Interference alignment based on rank constraint in MIMO cognitive radio networks (Q2333523) (← links)
- Transceiver design and power allocation for SWIPT in MIMO cognitive radio systems (Q2333936) (← links)
- Mars entry guidance based on nonlinear model predictive control with disturbance observer (Q2334192) (← links)
- Inherently trap-free convex landscapes for fully quantum optimal control (Q2334498) (← links)
- Constructing \(L_1\)-graphs for subspace learning via recurrent neural networks (Q2337448) (← links)
- Proximal gradient method for huberized support vector machine (Q2337512) (← links)
- ROP: matrix recovery via rank-one projections (Q2338922) (← links)
- Optimal information dissemination strategy to promote preventive behaviors in multilayer epidemic networks (Q2339924) (← links)
- A homogeneous interior-point algorithm for nonsymmetric convex conic optimization (Q2340336) (← links)
- Tensor principal component analysis via convex optimization (Q2340337) (← links)
- Estimation of positive definite \(M\)-matrices and structure learning for attractive Gaussian Markov random fields (Q2341885) (← links)
- A partial derandomization of phaselift using spherical designs (Q2342167) (← links)
- Sequences with minimal time-frequency uncertainty (Q2343252) (← links)
- Sparse learning via Boolean relaxations (Q2349117) (← links)
- Finding sparse solutions of systems of polynomial equations via group-sparsity optimization (Q2349523) (← links)
- Estimating network degree distributions under sampling: an inverse problem, with applications to monitoring social media networks (Q2349562) (← links)
- Mirror Prox algorithm for multi-term composite minimization and semi-separable problems (Q2350862) (← links)
- On exact quantum query complexity (Q2350895) (← links)
- An algorithm for decomposing a non-negative polynomial as a sum of squares of rational functions (Q2351490) (← links)
- Robust computation of linear models by convex relaxation (Q2351804) (← links)
- Better approximation algorithms for influence maximization in online social networks (Q2352355) (← links)
- A new semidefinite relaxation for \(L_{1}\)-constrained quadratic (Q2353474) (← links)
- On solving convex optimization problems with linear ascending constraints (Q2355310) (← links)
- Variations and extension of the convex-concave procedure (Q2358020) (← links)
- Decomposition techniques for bilinear saddle point problems and variational inequalities with affine monotone operators (Q2359772) (← links)
- Convergence and stability of iteratively reweighted least squares for low-rank matrix recovery (Q2360780) (← links)
- Regularized robust optimization: the optimal portfolio execution case (Q2376119) (← links)
- On sample size control in sample average approximations for solving smooth stochastic programs (Q2376122) (← links)
- Optimization of biochemical systems through mathematical programming: methods and applications (Q2379651) (← links)
- Real-time optimal commutation for minimizing thermally induced inaccuracy in multi-motor driven stages (Q2391444) (← links)
- Optimization of linear systems subject to bounded exogenous disturbances: the invariant ellipsoid technique (Q2392612) (← links)
- Improved design of unimodular waveforms for MIMO radar (Q2393108) (← links)
- Conic approximation to quadratic optimization with linear complementarity constraints (Q2397094) (← links)
- Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation (Q2397097) (← links)
- Maximum margin partial label learning (Q2398093) (← links)
- Adjusted robust mean-value-at-risk model: less conservative robust portfolios (Q2401246) (← links)
- How to solve a design centering problem (Q2408900) (← links)
- Lyapunov stability for piecewise affine systems via cone-copositivity (Q2409208) (← links)
- An observer-based control scheme using negative-imaginary theory (Q2409232) (← links)
- D-optimal input design for nonlinear FIR-type systems: a dispersion-based approach (Q2409286) (← links)
- Input design for discrimination between classes of LTI models (Q2409415) (← links)
- On optimal input design for networked systems (Q2409443) (← links)
- Globally sparse and locally dense signal recovery for compressed sensing (Q2410784) (← links)
- Construction and application of an ellipsoidal convex model using a semi-definite programming formulation from measured data (Q2414634) (← links)
- A multiplicative weight updates algorithm for packing and covering semi-infinite linear programs (Q2414864) (← links)
- A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme (Q2419534) (← links)
- Long-step path-following algorithm for solving symmetric programming problems with nonlinear objective functions (Q2419536) (← links)
