Graph implementations for nonsmooth convex programs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3901504 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- Applications of second-order cone programming
- Convex Analysis
- Convex analysis and nonlinear optimization. Theory and examples
- Disciplined convex programming
- Feature Article—The Ellipsoid Method: A Survey
- LOQO:an interior point code for quadratic programming
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Second-order cone programming
- Semidefinite Programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(only showing first 100 items - show all)- Static output feedback based fault accommodation design for continuous-time dynamic systems
- On elliptical quantiles in the quantile regression setup
- Path-based DEA models in multiplier form and returns-to-scale analysis
- Total variation isoperimetric profiles
- Distributionally robust optimization with infinitely constrained ambiguity sets
- Tractable sampling strategies for ordinal optimization
- S-matrix bootstrap in 3 + 1 dimensions: regularization and dual convex problem
- Graph-matrix calculus for computational convex analysis
- Distributed control of inverter-based lossy microgrids for power sharing and frequency regulation under voltage constraints
- An optimal experimental design perspective on radial basis function regression
- Environmental game modeling with uncertainties
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning
- Inverse optimal control for averaged cost per stage linear quadratic regulators
- Convergence and stability of iteratively reweighted least squares for low-rank matrix recovery
- Distributionally robust optimization for engineering design under uncertainty
- Convex optimization with an interpolation-based projection and its application to deep learning
- SUSPECT: MINLP special structure detector for Pyomo
- Nonlinear \(H_\infty\) feedback control with integrator for polynomial discrete-time systems
- Computing the lowest equilibrium pose of a cable-suspended rigid body
- Sharp recovery bounds for convex demixing, with applications
- Phase retrieval from local measurements: improved robustness via eigenvector-based angular synchronization
- Compressive sensing based machine learning strategy for characterizing the flow around a cylinder with limited pressure measurements
- Two pairs of families of polyhedral norms versus \(\ell _p\)-norms: proximity and applications in optimization
- Bayesian Factor Model Shrinkage for Linear IV Regression With Many Instruments
- Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis
- Data-driven predictive control in a stochastic setting: a unified framework
- Polyhedral approximation in mixed-integer convex optimization
- Compressed sensing in the spherical near-field to far-field transformation
- Smoothing gradient method for group-structured sparse feedback stabilization
- An adaptation for iterative structured matrix completion
- The local integro splines with optimized knots
- Best linear estimation via minimization of relative mean squared error
- Negative features of hyperbolic and directional distance models for technologies with undesirable outputs
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
- Improved row-by-row method for binary quadratic optimization problems
- Stable set polytopes with high lift-and-project ranks for the Lovász-Schrijver SPD operator
- Sparse control for continuous‐time systems
- Paired explicit Runge-Kutta schemes for stiff systems of equations
- MBLDA: a novel multiple between-class linear discriminant analysis
- Analysis and design of optimization algorithms via integral quadratic constraints
- A novel regularization-based optimization approach to sparse mean-reverting portfolios selection
- On the sample complexity of stabilizing linear dynamical systems from data
- Minimizing a sum of clipped convex functions
- Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems
- Metric learning for image alignment
- Compressive Fourier collocation methods for high-dimensional diffusion equations with periodic boundary conditions
- Optimal feature selection for support vector machines
- Elliptical multiple-output quantile regression and convex optimization
- Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints
- Optimal robust fault detection of discrete‐time LPV systems with measurement error‐affected scheduling variables combining ZKF and pQP
- A note on the S-matrix bootstrap for the 2d O(N) bosonic model
- A topology optimization formulation for transient design of multi-entry laminated piezocomposite energy harvesting devices coupled with electrical circuit
- Minimax principle and lower bounds in H^2-rational approximation
- Monotonicity-based regularization for phantom experiment data in electrical impedance tomography
- Local linear smoothing for sparse high dimensional varying coefficient models
- Adapting to unknown noise level in sparse deconvolution
- Finding planted subgraphs with few eigenvalues using the Schur-Horn relaxation
- Loop equations and bootstrap methods in the lattice
- A direct linear inversion for discontinuous elastic parameters recovery from internal displacement information only
- Duality and profit efficiency for the hyperbolic measure model
- Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming
- A multiplicative weights update algorithm for packing and covering semi-infinite linear programs
- Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach
- The random QUBO
- A method for weighted projections to the positive definite cone
- Efficient histogram dictionary learning for text/image modeling and classification
- Spectral Computed Tomography with Linearization and Preconditioning
- Automatic robust convex programming
- The greedy side of the LASSO: new algorithms for weighted sparse recovery via loss function-based orthogonal matching pursuit
- Smoothed state estimates under abrupt changes using sum-of-norms regularization
- Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs
- Tighter spectral bounds for the cut size, based on Laplacian eigenvectors
- Variations and extension of the convex-concave procedure
- A novel robust optimization model for nonlinear support vector machine
- Convex graph invariant relaxations for graph edit distance
- On indication, strict monotonicity, and efficiency of projections in a general class of path-based data envelopment analysis models
- Generalized Farkas lemma with adjustable variables and two-stage robust linear programs
- Computationally Efficient Approximations for Distributionally Robust Optimization Under Moment and Wasserstein Ambiguity
- Circular economy implementation in waste management network design problem: a case study
- A note on convex relaxations for the inverse eigenvalue problem
- Semiparametric expectile regression for high-dimensional heavy-tailed and heterogeneous data
- Segmentation of ARX-models using sum-of-norms regularization
- Robust regression through the Huber's criterion and adaptive lasso penalty
- Structured eigenvalue backward errors for rational matrix functions with symmetry structures
- Global solutions to folded concave penalized nonconvex learning
- Information matrix and D-optimal design with Gaussian inputs for Wiener model identification
- Regularized linear system identification using atomic, nuclear and kernel-based norms: the role of the stability constraint
- A second-order cone programming formulation for two player zero-sum games with chance constraints
- Semiring programming: a semantic framework for generalized sum product problems
- Can we trust the bootstrap in high-dimensions? The case of linear models
- Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems
- Collocation methods for Cauchy problems of elliptic operators via conditional stabilities
- Finding the nearest positive-real system
- Outer approximation algorithms for convex vector optimization problems
- On the sensitivity of the optimal partition for parametric second-order conic optimization
- Quantum bilinear optimization
- Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches
- Robust discriminative clustering with sparse regularizers
- Fast algorithms for _p-regression
- Robust estimation and shrinkage in ultrahigh dimensional expectile regression with heavy tails and variance heterogeneity
This page was built for publication: Graph implementations for nonsmooth convex programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3054001)
