The following pages link to CVX (Q16765):
Displaying 50 items.
- Nonconvex and nonsmooth sparse optimization via adaptively iterative reweighted methods (Q2052389) (← links)
- Dual-density-based reweighted \(\ell_1\)-algorithms for a class of \(\ell_0\)-minimization problems (Q2052391) (← links)
- Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity (Q2052413) (← links)
- Robust stability conditions for a family of linear discrete-time systems subjected to uncertainties (Q2052599) (← links)
- Static controller synthesis for peak-to-peak gain minimization as an optimization problem (Q2052602) (← links)
- Optimal sensor attacks in cyber-physical systems with round-robin protocol (Q2056371) (← links)
- Optimal portfolio selections via \(\ell_{1, 2}\)-norm regularization (Q2057226) (← links)
- Optimal representative sample weighting (Q2058720) (← links)
- Estimating variances in time series kriging using convex optimization and empirical BLUPs (Q2065314) (← links)
- Properties of optimal regression designs under the second-order least squares estimator (Q2066486) (← links)
- Physical watermarking for replay attack detection in continuous-time systems (Q2068555) (← links)
- Structural reliability under uncertainty in moments: distributionally-robust reliability-based design optimization (Q2070152) (← links)
- KDE distributionally robust portfolio optimization with higher moment coherent risk (Q2070731) (← links)
- Convex optimization with an interpolation-based projection and its application to deep learning (Q2071365) (← links)
- Model-free LQR design by Q-function learning (Q2071928) (← links)
- An adaptation for iterative structured matrix completion (Q2072669) (← links)
- Super-resolution for doubly-dispersive channel estimation (Q2073137) (← links)
- Minimax robust designs for regression models with heteroscedastic errors (Q2075031) (← links)
- Improving information reliability of non-radial value efficiency analysis: an additive slacks based measure approach (Q2076877) (← links)
- Robust sparse recovery via a novel convex model (Q2079105) (← links)
- Partial gradient optimal thresholding algorithms for a class of sparse optimization problems (Q2079693) (← links)
- On applications of Herglotz-Nevanlinna functions in material sciences. I: Classical theory and applications of sum rules (Q2080572) (← links)
- A disintegration of the Christoffel function (Q2080947) (← links)
- A multivariate Chebyshev bound of the Selberg form (Q2081114) (← links)
- Online learning of data-driven controllers for unknown switched linear systems (Q2081802) (← links)
- Integrating unimodality into distributionally robust optimal power flow (Q2085818) (← links)
- \texttt{Tenscalc}: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria (Q2088964) (← links)
- A semidefinite programming approach for the projection onto the cone of negative semidefinite symmetric tensors with applications to solid mechanics (Q2089080) (← links)
- Optimal linear attack for multi-sensor network against state estimation (Q2095002) (← links)
- Evaluation of exact quantum query complexities by semidefinite programming (Q2100824) (← links)
- On embeddings and inverse embeddings of input design for regularized system identification (Q2103641) (← links)
- Compressed sensing in the spherical near-field to far-field transformation (Q2106500) (← links)
- Some comments on Russell graph efficiency measures in data envelopment analysis: the multiplicative approach (Q2106765) (← links)
- Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints (Q2108537) (← links)
- Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty (Q2108799) (← links)
- An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems (Q2116605) (← links)
- A convex optimization approach to synthesizing state feedback data-driven controllers for switched linear systems (Q2116667) (← links)
- Convex graph invariant relaxations for graph edit distance (Q2118089) (← links)
- An efficient algorithm for the extended trust-region subproblem with two linear constraints (Q2119320) (← links)
- Accelerated implicit-explicit Runge-Kutta schemes for locally stiff systems (Q2120045) (← links)
- Solving symmetric and positive definite second-order cone linear complementarity problem by a rational Krylov subspace method (Q2120802) (← links)
- Robust estimation and shrinkage in ultrahigh dimensional expectile regression with heavy tails and variance heterogeneity (Q2122800) (← links)
- Linear system identification using the sequential stabilizing spline algorithm (Q2123234) (← links)
- Low-rank matrix recovery with Ky Fan 2-\(k\)-norm (Q2124796) (← links)
- Gaining or losing perspective (Q2124806) (← links)
- A unified framework to generate optimized compact finite difference schemes (Q2128506) (← links)
- Role of sparsity and structure in the optimization landscape of non-convex matrix sensing (Q2133410) (← links)
- Eigen-stratified models (Q2138309) (← links)
- Robust optimization and data classification for characterization of Huntington disease onset via duality methods (Q2139276) (← links)
- Robust CCMV model with short selling and risk-neutral interest rate (Q2140433) (← links)
