Recommendations
Cited in
(84)- Robust counterparts of errors-in-variables problems
- A penalty method for rank minimization problems in symmetric matrices
- A hybrid LP/NLP paradigm for global optimization relaxations
- CVX
- Optimal transport over nonlinear systems via infinitesimal generators on graphs
- Proximal alternating penalty algorithms for nonsmooth constrained convex optimization
- An interdiction game on a queueing network with multiple intruders
- A novel neural dynamical approach to convex quadratic program and its efficient applications
- Polyhedral approximation in mixed-integer convex optimization
- On-line optimal control of a class of discrete event systems with real-time constraints
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
- An objective penalty function method for biconvex programming
- Estimating variances in time series kriging using convex optimization and empirical BLUPs
- Convex optimization with an interpolation-based projection and its application to deep learning
- Precise statistical analysis of classification accuracies for adversarial training
- A unified convergence rate analysis of the accelerated smoothed gap reduction algorithm
- Eigen-stratified models
- Set-based control for disturbed piecewise affine systems with state and actuation constraints
- Cooperative output regulation problem of discrete-time linear multi-agent systems with Markov switching topologies
- SUSPECT: MINLP special structure detector for Pyomo
- Outer approximation with conic certificates for mixed-integer convex problems
- Disciplined quasiconvex programming
- A zero-forcing beamforming based time switching protocol for wireless powered Internet of Things system
- A convex optimization method to solve a filter design problem
- Disciplined geometric programming
- Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms
- The local integro splines with optimized knots
- Generalized self-concordant functions: a recipe for Newton-type methods
- Credible autocoding of convex optimization algorithms
- Pandemic risk management: resources contingency planning and allocation
- Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization
- CVXPY: a Python-embedded modeling language for convex optimization
- COAL: a generic modelling and prototyping framework for convex optimization problems of variational image analysis
- Automatic robust convex programming
- Matrix-free convex optimization modeling
- Graph implementations for nonsmooth convex programs
- Extended formulations in mixed-integer convex programming
- Reformulations in Mathematical Programming: Definitions and Systematics
- Dualize it: software for automatic primal and dual conversions of conic programs
- CVXGEN: a code generator for embedded convex optimization
- Sparsity enforcing edge detection method for blurred and noisy Fourier data
- Wavelet-based de-noising of positron emission tomography scans
- Adaptive observer-based fault estimation for stochastic Markovian jumping systems
- scientific article; zbMATH DE number 6860790 (Why is no real title available?)
- Quantum hedging in two-round prover-verifier interactions
- FOM -- a MATLAB toolbox of first-order methods for solving convex optimization problems
- Optimization conditions and decomposable algorithms for convertible nonconvex optimization
- Global method for learning an integrated temperature prediction model in a slab reheating furnace
- A new homotopy proximal variable-metric framework for composite convex minimization
- Generalized decomposition and cross entropy methods for many-objective optimization
- MathOptInterface: A Data Structure for Mathematical Optimization Problems
- Convex Optimization for Finite-Horizon Robust Covariance Control of Linear Stochastic Systems
- Smoothing partially exact penalty function of biconvex programming
- Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
- A single-phase, proximal path-following framework
- Adaptive smoothing algorithms for nonsmooth composite convex minimization
- SnapVX: a network-based convex optimization solver
- JuMP: a modeling language for mathematical optimization
- Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers
- Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem
- DrAmpl: A meta solver for optimization problem analysis
- Disjunctive cuts in mixed-integer conic optimization
- Designing experiments toward shrinkage estimation
- Minimizing oracle-structured composite functions
- Two-dimensional digital filters with sparse coefficients
- Domain-Driven Solver (DDS) Version 2.0: a MATLAB-based Software Package for Convex Optimization Problems in Domain-Driven Form
- Robust stabilization of stochastic Markovian jumping systems via proportional-integral control
- Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones
- Verified reductions for optimization
- Output-based enhanced closed-loop model reference adaptive control and its application to direct yaw moment control
- Specifying and solving robust empirical risk minimization problems using CVXPY
- 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
- Inferring stable genetic networks from steady-state data
- Polyak minorant method for convex optimization
- Efficient neural network approaches for conditional optimal transport with applications in Bayesian inference
- Optimal spot slides
- Skewness of a randomized quasi-Monte Carlo estimate
- AutoFusion of feature pruning for decision making in operations research
- Exact approaches for competitive facility location with discrete attractiveness
- Convex duality and calculus: Reduction to cones
Describes a project that uses
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)
