Graph Implementations for Nonsmooth Convex Programs

DOI10.1007/978-1-84800-155-8_7zbMath1205.90223MaRDI QIDQ3054001

Publication date: 5 November 2010

Published in: Lecture Notes in Control and Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-84800-155-8_7

zbMATH Keywords

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

Mathematics Subject Classification ID

90C25: Convex programming

Related Items

Approximate Time Bounded Reachability for CTMCs and CTMDPs: A Lyapunov Approach, On the regularization and optimization in quantum detector tomography, Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints, Outer approximation algorithms for convex vector optimization problems, Graph Topology Invariant Gradient and Sampling Complexity for Decentralized and Stochastic Optimization, DCACO: an algorithm for designing incoherent redundant matrices, Data-driven predictive control in a stochastic setting: a unified framework, Multi-period liability clearing via convex optimal control, Optimizing the efficiency of first-order methods for decreasing the gradient of smooth convex functions, Minimal-norm static feedbacks using dissipative Hamiltonian matrices, Geometric Rényi divergence and its applications in quantum channel capacities, Analysis of optimization algorithms via sum-of-squares, Optimal representative sample weighting, Line spectrum representation for vector processes with application to frequency estimation, Structural reliability under uncertainty in moments: distributionally-robust reliability-based design optimization, Convex optimization with an interpolation-based projection and its application to deep learning, An adaptation for iterative structured matrix completion, Integrating unimodality into distributionally robust optimal power flow, \texttt{Tenscalc}: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria, Evaluation of exact quantum query complexities by semidefinite programming, Compressed sensing in the spherical near-field to far-field transformation, Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints, Convex graph invariant relaxations for graph edit distance, Accelerated implicit-explicit Runge-Kutta schemes for locally stiff systems, Solving symmetric and positive definite second-order cone linear complementarity problem by a rational Krylov subspace method, Robust estimation and shrinkage in ultrahigh dimensional expectile regression with heavy tails and variance heterogeneity, Role of sparsity and structure in the optimization landscape of non-convex matrix sensing, Generalized maximum entropy based identification of graphical ARMA models, On the non-symmetric semidefinite Procrustes problem, Adaptive primal-dual stochastic gradient method for expectation-constrained convex stochastic programs, DC semidefinite programming and cone constrained DC optimization. I: Theory, A norm minimization-based convex vector optimization algorithm, SUSPECT: MINLP special structure detector for Pyomo, Goal scoring, coherent loss and applications to machine learning, A representation theory perspective on simultaneous alignment and classification, Sign projected gradient flow: a continuous-time approach to convex optimization with linear equality constraints, Semiring programming: a semantic framework for generalized sum product problems, Optimal Runge-Kutta schemes for pseudo time-stepping with high-order unstructured methods, Linear matrix inequalities in control problems, Robust trade-off portfolio selection, Paired explicit Runge-Kutta schemes for stiff systems of equations, Circular economy implementation in waste management network design problem: a case study, An accelerated Uzawa method for application to frictionless contact problem, Minimizing a sum of clipped convex functions, A note on convex relaxations for the inverse eigenvalue problem, On the sensitivity of the optimal partition for parametric second-order conic optimization, Accelerated proximal point method for maximally monotone operators, HYIMFO: hybrid method for optimizing fiber orientation angles in laminated piezocomposite actuators, Convergence and stability analysis of iteratively reweighted least squares for noisy block sparse recovery, Performance of first-order methods for smooth convex minimization: a novel approach, A convex optimization method to solve a filter design problem, An efficient algorithm for structured sparse quantile regression, Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming, Phase retrieval from local measurements: improved robustness via eigenvector-based angular synchronization, Distributed greedy algorithm for multi-agent task assignment problem with submodular utility functions, Hierarchical multistage Gaussian signaling games in noncooperative communication and control systems, MBLDA: a novel multiple between-class linear discriminant analysis, Solution refinement at regular points of conic problems, Optimization of bilinear control systems subjected to exogenous disturbances. II: Design, Uniform recovery from subgaussian multi-sensor measurements, Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation, Optimized dynamic design of laminated piezocomposite multi-entry actuators considering fiber orientation, Disciplined geometric programming, Detecting edges from non-uniform Fourier data via sparse Bayesian learning, Environmental game modeling with uncertainties, Template polyhedra and bilinear optimization, Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning, The local integro splines with optimized knots, Improved row-by-row method for binary quadratic optimization problems, Best linear estimation via minimization of relative mean squared error, ROP: matrix recovery via rank-one projections, Sparse learning via Boolean relaxations, Finding sparse solutions of systems of polynomial equations via group-sparsity optimization, Robust computation of linear models by convex relaxation, Lagrangian methods for approximating the viability kernel in high-dimensional systems, Variations and extension of the convex-concave procedure, Convergence and stability of iteratively reweighted least squares for low-rank matrix recovery, Loop equations and bootstrap methods in the lattice, How to solve a design centering problem, Multiple window moving horizon estimation, A multiplicative weight updates algorithm for packing and covering semi-infinite linear programs, Tighter spectral bounds for the cut size, based on Laplacian eigenvectors, A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme, Correcting for unknown errors in sparse high-dimensional function approximation, Controlling portfolio skewness and kurtosis without directly optimizing third and fourth moments, Optimal feature selection for support vector machines, $\ell^1$-analysis minimization and generalized (co-)sparsity: when does recovery succeed?, Finite-time stabilization of state dependent impulsive dynamical linear systems, Completing an operator matrix and the free joint numerical radius, Regularized sample average approximation for high-dimensional stochastic optimization under low-rankness, A subgradient method with non-monotone line search, A Compressive Sensing Based Analysis of Anomalies in Generalized Linear Models, Optimal current waveforms for brushless permanent magnet motors, Joint optimisation of price, warranty and recovery planning in remanufacturing of used products under linear and non-linear demand, return and cost functions, On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0, MIMO PID tuning via iterated LMI restriction, Multidimensional Rational Covariance Extension with Applications to Spectral Estimation and Image Compression, Model predictive control of P-time event graphs, Low-Rank Approximation and Completion of Positive Tensors, STABLE – a stability algorithm for parametric model reduction by matrix interpolation, A convex relaxation for the time-optimal trajectory planning of robotic manipulators along predetermined geometric paths, Automatic robust convex programming, Analysis and design of robust estimation filter for a class of continuous-time nonlinear systems, Compressive sensing based machine learning strategy for characterizing the flow around a cylinder with limited pressure measurements, Non-linear Local Polynomial Regression Multiresolution Methods Using $$\ell ^1$$-norm Minimization with Application to Signal Processing, A three-species model for simulating torsional response of shape memory alloy components using thermodynamic principles and discrete Preisach models, Conditions for optimal input states for discrimination of quantum channels, Weighted norms in subspace-based methods for time series analysis, 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, Minimax principle and lower bounds in $H^2$-rational approximation, Local linear smoothing for sparse high dimensional varying coefficient models, 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, Extended reverse-convex programming: an approximate enumeration approach to global optimization, Image reconstruction from undersampled Fourier data using the polynomial annihilation transform, Consistency of probability measure quantization by means of power repulsion-attraction potentials, 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, Lieb's concavity theorem, matrix geometric means, and semidefinite optimization, Robust sparse phase retrieval made easy, On elliptical quantiles in the quantile regression setup, 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, Sharp recovery bounds for convex demixing, with applications, Metric learning for image alignment, 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, Optimal link removal for epidemic mitigation: A two-way partitioning approach, Iterative design of concentration factors for jump detection, Maximum divert for planetary landing using convex optimization, 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, A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals, Simultaneous nonlinear model predictive control and state estimation, Measurement uncertainty for finite quantum observables, Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones, Democracy in action: quantization, saturation, and compressive sensing, Convex optimisation-based methods for K-complex detection, On the robustness and scalability of semidefinite relaxation for optimal power flow problems, The O(N) S-matrix monolith, Exact approaches for competitive facility location with discrete attractiveness, Optimizing over the properly efficient set of convex multi-objective optimization problems, A linear-quadratic optimal control problem for mean-field stochastic differential equations in infinite horizon, An interval estimator for the unmixing of mixtures with set-based source descriptions, A perspective-based convex relaxation for switched-affine optimal control, A Youla-Kučera parameterization approach to output feedback relatively optimal control, Learning discriminative localization from weakly labeled data, Image reconstruction from Fourier data using sparsity of edges, Elliptical multiple-output quantile regression and convex optimization, MUSIC for single-snapshot spectral estimation: stability and super-resolution, Sampling in the analysis transform domain, Construction, management, and performance of sparse Markowitz portfolios, Segmentation of ARX-models using sum-of-norms regularization, Constrained regulation of continuous Petri nets, Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach, An optimal approach for the critical node problem using semidefinite programming, State and unknown input observers for nonlinear systems with delayed measurements, A note on the S-matrix bootstrap for the 2d O(N) bosonic model, Optimal distributed task scheduling in volunteer clouds, SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization, 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, Sparsity enabled cluster reduced-order models for control, A semi-analytical approach for the positive semidefinite Procrustes problem, A low complexity semidefinite relaxation for large-scale MIMO detection, Universality and optimality in the information-disturbance tradeoff, Vector tomography for reconstructing electric fields with non-zero divergence in bounded domains, A second-order cone programming formulation for two player zero-sum games with chance constraints, Robust linear output regulation using extended state observer, Further results on diagonally invariant exponential stability of switching linear systems, Efficient histogram dictionary learning for text/image modeling and classification, Optimal attacks on qubit-based quantum key recycling, A semidefinite programming method for integer convex quadratic minimization, Quantile hedging in a semi-static market with model uncertainty, An interdiction game on a queueing network with multiple intruders, The Russell measure model: computational aspects, duality, and profit efficiency, Real zero polynomials and A. Horn's problem, Quadratic convex reformulation for quadratic programming with linear on-off constraints, 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, Generalized locality preserving maxi-min margin machine, 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, 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, Approximation of stability radii for large-scale dissipative Hamiltonian systems, 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, A direct linear inversion for discontinuous elastic parameters recovery from internal displacement information only, Duality and profit efficiency for the hyperbolic measure model, Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches, 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, Unnamed Item, Unnamed Item, Generalized System Identification with Stable Spline Kernels, Monotonicity-Based Regularization for Phantom Experiment Data in Electrical Impedance Tomography, Joint image reconstruction method with correlative multi-channel prior for x-ray spectral computed tomography, Distributionally Robust Optimization with Principal Component Analysis, Generalizing the Optimized Gradient Method for Smooth Convex Minimization, Multicompartment magnetic resonance fingerprinting, Detection of core–periphery structure in networks using spectral methods and geodesic paths, Another Look at the Fast Iterative Shrinkage/Thresholding Algorithm (FISTA), Adapting to unknown noise level in sparse deconvolution, Multidimensional Rational Covariance Extension with Approximate Covariance Matching, Bounds for Random Binary Quadratic Programs, Finding Planted Subgraphs with Few Eigenvalues using the Schur--Horn Relaxation, Bayesian sequential joint detection and estimation, Consistency Analysis for Massively Inconsistent Datasets in Bound-to-Bound Data Collaboration, Finding the Nearest Positive-Real System, Can we trust the bootstrap in high-dimension?, Image Reconstruction with Imperfect Forward Models and Applications in Deblurring, Model predictive control of constrained LPV systems, Sparse linear discriminant analysis in structured covariates space, The Big Data Newsvendor: Practical Insights from Machine Learning, Unnamed Item, Static output feedback control of positive linear systems with output time delays, Online quantum state tomography of N-qubit via continuous weak measurement and compressed sensing, A Benson-type algorithm for bounded convex vector optimization problems with vertex selection, Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems, Sparse Representation for Sampled-Data $$H^\infty $$ Filters, The Random QUBO, Euclidean Distance Bounds for Linear Matrix Inequalities Analytic Centers Using a Novel Bound on the Lambert Function, Identifying 3D Genome Organization in Diploid Organisms via Euclidean Distance Geometry, Unnamed Item, Functional Portfolio Optimization in Stochastic Portfolio Theory, TREND EXTRACTION FROM ECONOMIC TIME SERIES WITH MISSING OBSERVATIONS BY GENERALIZED HODRICK–PRESCOTT FILTERS, A Nonconvex Optimization Approach to IMRT Planning with Dose–Volume Constraints, Computationally Efficient Approximations for Distributionally Robust Optimization Under Moment and Wasserstein Ambiguity, Bayesian sequential joint detection and estimation under multiple hypotheses, Portfolio optimization with two quasiconvex risk measures, Extremal spectral gaps for periodic Schrödinger operators, Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets, H-infinity set-membership observer design for discrete-time LPV systems, Tractable Sampling Strategies for Ordinal Optimization, Data driven regularization by projection, Optimal randomness certification in the quantum steering and prepare-and-measure scenarios, SINDy-PI: a robust algorithm for parallel implicit sparse identification of nonlinear dynamics, Collocation Methods for Cauchy Problems of Elliptic Operators via Conditional Stabilities, Anderson Acceleration for a Class of Nonsmooth Fixed-Point Problems, Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity, Total Variation Isoperimetric Profiles, Collective mental accounting: an integrated behavioural portfolio selection model for multiple mental accounts, Spectral Computed Tomography with Linearization and Preconditioning, Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization, Convergence Analysis for Anderson Acceleration, Structured Eigenvalue Backward Errors of Matrix Pencils and Polynomials with Palindromic Structures, Linear Inverse Problem with Range Prior on Correlations and Its Variational Bayes Inference, Robustness analysis of uncertain discrete‐time systems with dissipation inequalities and integral quadratic constraints, Quadratic Convex Reformulations for Semicontinuous Quadratic Programming, Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs, Large Margin Low Rank Tensor Analysis, Robust Support Vector Machines for Classification with Nonconvex and Smooth Losses, A framework of robust fault estimation observer design for continuous‐time/discrete‐time systems, Coupled structure-from-motion and 3D symmetry detection for urban facades, A novel representation of rank constraints for real matrices, An Optimality Gap Test for a Semidefinite Relaxation of a Quadratic Program with Two Quadratic Constraints, Representing Model Discrepancy in Bound-to-Bound Data Collaboration, Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis, The best approximation of a given qubit state with the limited pure-state set, Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems, Quantum earth mover’s distance, a no-go quantum Kantorovich–Rubinstein theorem, and quantum marginal problem, Embracing off-the-grid samples, Trajectory optimization with obstacles avoidance via strong duality equivalent and hp‐pseudospectral sequential convex programming, Design of linear parameter varying quadratic regulator in polynomial chaos framework, Optimal robust fault detection of discrete‐time LPV systems with measurement error‐affected scheduling variables combining ZKF and pQP, A unified approach to radial, hyperbolic, and directional efficiency measurement in data envelopment analysis, Combined invariant subspace \& frequency-domain subspace method for identification of discrete-time MIMO linear systems, Semidefinite programming bounds for binary codes from a split Terwilliger algebra, l₁common trend filtering: an extension, New iterative linear matrix inequality based procedure for H₂ and H_∞ state feedback control of continuous‐time polytopic systems, A family of pairwise multi-marginal optimal transports that define a generalized metric, Fast certifiable relative pose estimation with gravity prior, Enhancing residual-based techniques with shape reconstruction features in electrical impedance tomography, Matrix-Free Convex Optimization Modeling, A Multiplicative Weights Update Algorithm for Packing and Covering Semi-infinite Linear Programs, New control allocation algorithms in fixed point framework for overactuated systems with actuator saturation, Inferring interaction rules from observations of evolutive systems I: The variational approach, An Optimal Experimental Design Perspective on Radial Basis Function Regression, ACADO toolkit-An open-source framework for automatic control and dynamic optimization, Static output feedback based fault accommodation design for continuous-time dynamic systems, Unnamed Item, Fast Phase Retrieval from Local Correlation Measurements, Quantum Bilinear Optimization, Exact and Heuristic Algorithms for Semi-Nonnegative Matrix Factorization, Dynamic Energy Management, Estimating the Probability that a Function Observed with Noise Is Convex, Fault estimation observer design for discrete‐time systems in finite‐frequency domain, A method for weighted projections to the positive definite cone, Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints, Optimal Information Blending with Measurements in the L² Sphere, Interior Point Methods for Nonlinear Optimization

Uses Software

Cites Work