Graph Implementations for Nonsmooth Convex Programs

semidefinite programming conic optimization second-order cone programming nondifferentiable functions disciplined convex programming optimization modeling languages

Mathematics Subject Classification ID

Convex programming (90C25)

Cites Work

Related Items (only showing first 100 items - show all)

Minimax principle and lower bounds in \(H^2\)-rational approximation ⋮ Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach ⋮ Local linear smoothing for sparse high dimensional varying coefficient models ⋮ An optimal approach for the critical node problem using semidefinite programming ⋮ Global solutions to folded concave penalized nonconvex learning ⋮ Exact approaches for competitive facility location with discrete attractiveness ⋮ Optimizing over the properly efficient set of convex multi-objective optimization problems ⋮ 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 ⋮ Extended reverse-convex programming: an approximate enumeration approach to global optimization ⋮ State and unknown input observers for nonlinear systems with delayed measurements ⋮ Image reconstruction from undersampled Fourier data using the polynomial annihilation transform ⋮ Consistency of probability measure quantization by means of power repulsion-attraction potentials ⋮ A note on the S-matrix bootstrap for the 2d O(N) bosonic model ⋮ Comparison of support-vector machine and sparse representation using a modified rule-based method for automated myocardial ischemia detection ⋮ Optimized first-order methods for smooth convex minimization ⋮ Robust stability and performance analysis based on integral quadratic constraints ⋮ A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem ⋮ Image denoising by generalized total variation regularization and least squares fidelity ⋮ Optimal distributed task scheduling in volunteer clouds ⋮ SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization ⋮ Lieb's concavity theorem, matrix geometric means, and semidefinite optimization ⋮ Robust sparse phase retrieval made easy ⋮ General sparse multi-class linear discriminant analysis ⋮ Nonlinear state feedback control for a class of polynomial nonlinear discrete-time systems with norm-bounded uncertainties: an integrator approach ⋮ A convex programming approach to the inverse kinematics problem for manipulators under constraints ⋮ Mixed Hölder matrix discovery via wavelet shrinkage and Calderón-Zygmund decompositions ⋮ Probably certifiably correct \(k\)-means clustering ⋮ A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints ⋮ On elliptical quantiles in the quantile regression setup ⋮ Sparsity enabled cluster reduced-order models for control ⋮ A linear-quadratic optimal control problem for mean-field stochastic differential equations in infinite horizon ⋮ Component selection in additive quantile regression models ⋮ CVXGEN: a code generator for embedded convex optimization ⋮ Nonlinear \(H_\infty\) feedback control with integrator for polynomial discrete-time systems ⋮ Computing the lowest equilibrium pose of a cable-suspended rigid body ⋮ An interval estimator for the unmixing of mixtures with set-based source descriptions ⋮ Sharp recovery bounds for convex demixing, with applications ⋮ A perspective-based convex relaxation for switched-affine optimal control ⋮ A semi-analytical approach for the positive semidefinite Procrustes problem ⋮ A Youla-Kučera parameterization approach to output feedback relatively optimal control ⋮ Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones ⋮ Metric learning for image alignment ⋮ Learning discriminative localization from weakly labeled data ⋮ Image reconstruction from Fourier data using sparsity of edges ⋮ Elliptical multiple-output quantile regression and convex optimization ⋮ Smoothed state estimates under abrupt changes using sum-of-norms regularization ⋮ MUSIC for single-snapshot spectral estimation: stability and super-resolution ⋮ Sampling in the analysis transform domain ⋮ Generalized locality preserving maxi-min margin machine ⋮ Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs ⋮ Optimal link removal for epidemic mitigation: A two-way partitioning approach ⋮ Construction, management, and performance of sparse Markowitz portfolios ⋮ A low complexity semidefinite relaxation for large-scale MIMO detection ⋮ Robust regression through the Huber's criterion and adaptive lasso penalty ⋮ Two proposals for robust PCA using semidefinite programming ⋮ An efficient approach to solve the large-scale semidefinite programming problems ⋮ Democracy in action: quantization, saturation, and compressive sensing ⋮ Universality and optimality in the information-disturbance tradeoff ⋮ Vector tomography for reconstructing electric fields with non-zero divergence in bounded domains ⋮ Iterative design of concentration factors for jump detection ⋮ A second-order cone programming formulation for two player zero-sum games with chance constraints ⋮ Maximum divert for planetary landing using convex optimization ⋮ Robust linear output regulation using extended state observer ⋮ Further results on diagonally invariant exponential stability of switching linear systems ⋮ Optimal strong-stability-preserving Runge-Kutta time discretizations for discontinuous Galerkin methods ⋮ Non-negatively constrained least squares and parameter choice by the residual periodogram for the inversion of electrochemical impedance spectroscopy data ⋮ Primal and dual approximation algorithms for convex vector optimization problems ⋮ Convex optimisation-based methods for K-complex detection ⋮ Exact matrix completion based on low rank Hankel structure in the Fourier domain ⋮ S-matrix bootstrap in 3 + 1 dimensions: regularization and dual convex problem ⋮ Efficient histogram dictionary learning for text/image modeling and classification ⋮ A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals ⋮ Approximation of stability radii for large-scale dissipative Hamiltonian systems ⋮ Optimal attacks on qubit-based quantum key recycling ⋮ Simultaneous nonlinear model predictive control and state estimation ⋮ Negative features of hyperbolic and directional distance models for technologies with undesirable outputs ⋮ A semidefinite programming method for integer convex quadratic minimization ⋮ Measurement uncertainty for finite quantum observables ⋮ Quantile hedging in a semi-static market with model uncertainty ⋮ An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming ⋮ An interdiction game on a queueing network with multiple intruders ⋮ The Russell measure model: computational aspects, duality, and profit efficiency ⋮ A direct linear inversion for discontinuous elastic parameters recovery from internal displacement information only ⋮ Real zero polynomials and A. Horn's problem ⋮ Quadratic convex reformulation for quadratic programming with linear on-off constraints ⋮ Duality and profit efficiency for the hyperbolic measure model ⋮ Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches ⋮ Segmentation of ARX-models using sum-of-norms regularization ⋮ Stable and real-zero polynomials in two variables ⋮ Analysis of biased stochastic gradient descent using sequential semidefinite programs ⋮ Generalized Farkas lemma with adjustable variables and two-stage robust linear programs ⋮ Alternating direction method of multipliers for truss topology optimization with limited number of nodes: a cardinality-constrained second-order cone programming approach ⋮ Practical matrix completion and corruption recovery using proximal alternating robust subspace minimization ⋮ Polyhedral approximation in mixed-integer convex optimization ⋮ Constrained regulation of continuous Petri nets ⋮ On the robustness and scalability of semidefinite relaxation for optimal power flow problems ⋮ The O(N) S-matrix monolith ⋮ Distributed control of inverter-based lossy microgrids for power sharing and frequency regulation under voltage constraints ⋮ Two pairs of families of polyhedral norms versus \(\ell _p\)-norms: proximity and applications in optimization

Uses Software

This page was built for publication: Graph Implementations for Nonsmooth Convex Programs