Graph implementations for nonsmooth convex programs
From MaRDI portal
Recommendations
Cites work
- 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
- 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?)
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- LOQO:an interior point code for quadratic programming
- 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)- 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
- 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
- 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
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)
