Pages that link to "Item:Q3054001"
From MaRDI portal
The following pages link to Graph Implementations for Nonsmooth Convex Programs (Q3054001):
Displayed 50 items.
- Distributed control of inverter-based lossy microgrids for power sharing and frequency regulation under voltage constraints (Q254544) (← links)
- Two pairs of families of polyhedral norms versus \(\ell _p\)-norms: proximity and applications in optimization (Q263209) (← links)
- Minimax principle and lower bounds in \(H^2\)-rational approximation (Q268416) (← links)
- Local linear smoothing for sparse high dimensional varying coefficient models (Q276223) (← links)
- Global solutions to folded concave penalized nonconvex learning (Q282459) (← links)
- Information matrix and D-optimal design with Gaussian inputs for Wiener model identification (Q286245) (← links)
- Regularized linear system identification using atomic, nuclear and kernel-based norms: the role of the stability constraint (Q286265) (← links)
- Extended reverse-convex programming: an approximate enumeration approach to global optimization (Q288222) (← links)
- Image reconstruction from undersampled Fourier data using the polynomial annihilation transform (Q292541) (← links)
- Consistency of probability measure quantization by means of power repulsion-attraction potentials (Q301584) (← links)
- On elliptical quantiles in the quantile regression setup (Q391531) (← links)
- Component selection in additive quantile regression models (Q397238) (← links)
- CVXGEN: a code generator for embedded convex optimization (Q399985) (← links)
- Nonlinear \(H_\infty\) feedback control with integrator for polynomial discrete-time systems (Q402005) (← links)
- Computing the lowest equilibrium pose of a cable-suspended rigid body (Q402228) (← links)
- Sharp recovery bounds for convex demixing, with applications (Q404302) (← links)
- Metric learning for image alignment (Q408770) (← links)
- Smoothed state estimates under abrupt changes using sum-of-norms regularization (Q417799) (← links)
- Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs (Q421275) (← links)
- Optimal link removal for epidemic mitigation: A two-way partitioning approach (Q423087) (← links)
- Iterative design of concentration factors for jump detection (Q454332) (← links)
- Maximum divert for planetary landing using convex optimization (Q463013) (← links)
- Optimal strong-stability-preserving Runge-Kutta time discretizations for discontinuous Galerkin methods (Q474942) (← links)
- Non-negatively constrained least squares and parameter choice by the residual periodogram for the inversion of electrochemical impedance spectroscopy data (Q475643) (← links)
- Primal and dual approximation algorithms for convex vector optimization problems (Q475807) (← links)
- Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones (Q621748) (← links)
- Democracy in action: quantization, saturation, and compressive sensing (Q643647) (← links)
- A linear-quadratic optimal control problem for mean-field stochastic differential equations in infinite horizon (Q888784) (← links)
- An interval estimator for the unmixing of mixtures with set-based source descriptions (Q892187) (← links)
- A perspective-based convex relaxation for switched-affine optimal control (Q893481) (← links)
- A Youla-Kučera parameterization approach to output feedback relatively optimal control (Q893999) (← links)
- Learning discriminative localization from weakly labeled data (Q898394) (← links)
- Image reconstruction from Fourier data using sparsity of edges (Q898494) (← links)
- Elliptical multiple-output quantile regression and convex optimization (Q899672) (← links)
- MUSIC for single-snapshot spectral estimation: stability and super-resolution (Q900773) (← links)
- Sampling in the analysis transform domain (Q900778) (← links)
- Construction, management, and performance of sparse Markowitz portfolios (Q905387) (← links)
- Segmentation of ARX-models using sum-of-norms regularization (Q976288) (← links)
- Constrained regulation of continuous Petri nets (Q1036660) (← links)
- Generalized locality preserving maxi-min margin machine (Q1942712) (← 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)
- Performance of first-order methods for smooth convex minimization: a novel approach (Q2248759) (← links)
- A convex optimization method to solve a filter design problem (Q2252696) (← links)
- An efficient algorithm for structured sparse quantile regression (Q2259790) (← links)
- ROP: matrix recovery via rank-one projections (Q2338922) (← links)
- Sparse learning via Boolean relaxations (Q2349117) (← links)
- Finding sparse solutions of systems of polynomial equations via group-sparsity optimization (Q2349523) (← links)
- Robust computation of linear models by convex relaxation (Q2351804) (← links)