Learning to optimize: a tutorial for continuous and mixed-integer optimization
From MaRDI portal
Cites work
- rm K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX
- A machine learning-based approximation of strong branching
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- A three-operator splitting scheme and its optimization applications
- Adaptive cut selection in mixed-integer linear programming
- Adaptive large neighborhood search for mixed integer programming
- AMP-Inspired Deep Networks for Sparse Linear Inverse Problems
- Automatic MILP Solver configuration by learning problem similarities
- Beyond a Gaussian Denoiser: Residual Learning of Deep CNN for Image Denoising
- Compressive sensing and neural networks from a statistical learning perspective
- DECONET: an unfolding network for analysis-based compressed sensing with generalization error bounds
- Deep learning
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Evaluating Derivatives
- Gomory cuts revisited
- scientific article; zbMATH DE number 3156817 (Why is no real title available?)
- scientific article; zbMATH DE number 7124428 (Why is no real title available?)
- scientific article; zbMATH DE number 6276119 (Why is no real title available?)
- Instance-specific algorithm configuration
- Integer Programming
- Large-scale convex optimization. Algorithms \& analyses via monotone operators
- Learning Proximal Operator Methods for Nonconvex Sparse Recovery with Theoretical Guarantee
- Learning to Detect
- Local branching
- MaxSAT by improved instance-specific algorithm configuration
- Model-Driven Deep Learning for MIMO Detection
- MPILS: an automatic tuner for MILP solvers
- Multilayer feedforward networks are universal approximators
- Nonlinear total variation based noise removal algorithms
- Paramils: an automatic algorithm configuration framework
- Regularization by denoising via fixed-point projection (RED-PRO)
- Reinforcement learning for variable selection in a branch and bound algorithm
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- Tradeoffs Between Convergence Speed and Reconstruction Accuracy in Inverse Problems
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Wasserstein-based projections with applications to inverse problems
Cited in
(3)
This page was built for publication: Learning to optimize: a tutorial for continuous and mixed-integer optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564763)
