Disciplined convex programming
From MaRDI portal
Publication:5492525
zbMATH Open1130.90382MaRDI QIDQ5492525FDOQ5492525
Authors: Michael C. Grant, Yinyu Ye, Stephen Boyd 
Publication date: 13 October 2006
Recommendations
Cited In (73)
- Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
- SUSPECT: MINLP special structure detector for Pyomo
- Convex optimization with an interpolation-based projection and its application to deep learning
- Polyhedral approximation in mixed-integer convex optimization
- The local integro splines with optimized knots
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
- Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem
- Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms
- Generalized self-concordant functions: a recipe for Newton-type methods
- Automatic robust convex programming
- Convex duality and calculus: Reduction to cones
- A penalty method for rank minimization problems in symmetric matrices
- Sparsity enforcing edge detection method for blurred and noisy Fourier data
- Wavelet-based de-noising of positron emission tomography scans
- A unified convergence rate analysis of the accelerated smoothed gap reduction algorithm
- An interdiction game on a queueing network with multiple intruders
- Proximal alternating penalty algorithms for nonsmooth constrained convex optimization
- A zero-forcing beamforming based time switching protocol for wireless powered Internet of things system
- Eigen-stratified models
- Graph implementations for nonsmooth convex programs
- Disciplined geometric programming
- Reformulations in Mathematical Programming: Definitions and Systematics
- Robust counterparts of errors-in-variables problems
- A Single-Phase, Proximal Path-Following Framework
- Adaptive observer-based fault estimation for stochastic Markovian jumping systems
- Disciplined quasiconvex programming
- Optimal transport over nonlinear systems via infinitesimal generators on graphs
- Precise statistical analysis of classification accuracies for adversarial training
- Inferring stable genetic networks from steady-state data
- CVX
- Disjunctive cuts in mixed-integer conic optimization
- Two-dimensional digital filters with sparse coefficients
- Matrix-Free Convex Optimization Modeling
- Robust stabilization of stochastic Markovian jumping systems via proportional-integral control
- MathOptInterface: A Data Structure for Mathematical Optimization Problems
- CVXGEN: a code generator for embedded convex optimization
- Pandemic risk management: resources contingency planning and allocation
- DrAmpl: A meta solver for optimization problem analysis
- A hybrid LP/NLP paradigm for global optimization relaxations
- JuMP: A Modeling Language for Mathematical Optimization
- Exact approaches for competitive facility location with discrete attractiveness
- Set-based control for disturbed piecewise affine systems with state and actuation constraints
- Title not available (Why is that?)
- Estimating variances in time series kriging using convex optimization and empirical BLUPs
- Cooperative output regulation problem of discrete-time linear multi-agent systems with Markov switching topologies
- On-line optimal control of a class of discrete event systems with real-time constraints
- Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization
- Dualize it: software for automatic primal and dual conversions of conic programs
- Outer approximation with conic certificates for mixed-integer convex problems
- A novel neural dynamical approach to convex quadratic program and its efficient applications
- Extended Formulations in Mixed-Integer Convex Programming
- Generalized decomposition and cross entropy methods for many-objective optimization
- A convex optimization method to solve a filter design problem
- An objective penalty function method for biconvex programming
- Adaptive smoothing algorithms for nonsmooth composite convex minimization
- Designing experiments toward shrinkage estimation
- Output-based enhanced closed-loop model reference adaptive control and its application to direct yaw moment control
- Quantum hedging in two-round prover-verifier interactions
- Convex Optimization for Finite-Horizon Robust Covariance Control of Linear Stochastic Systems
- Minimizing oracle-structured composite functions
- Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers
- Smoothing Partially Exact Penalty Function of Biconvex Programming
- Safety signal detection with control of latent factors
- Efficient functional Lasso kernel smoothing for high-dimensional additive regression
- Generalizing the Results from Social Experiments: Theory and Evidence from India
- Implementation of an oracle-structured bundle method for distributed optimization
- Transforming optimization problems into disciplined convex programming form
- Polyak minorant method for convex optimization
- Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones
- Optimization conditions and decomposable algorithms for convertible nonconvex optimization
- Global method for learning an integrated temperature prediction model in a slab reheating furnace
- Verified reductions for optimization
- A New Homotopy Proximal Variable-Metric Framework for Composite Convex Minimization
Uses Software
This page was built for publication: Disciplined convex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5492525)
