Data-driven performance guarantees for classical and learned optimizers
From MaRDI portal
Cites work
- A PAC Approach to Application-Specific Algorithm Selection
- A tutorial on geometric programming
- Analysis and design of optimization algorithms via integral quadratic constraints
- Analysis of optimization algorithms via integral quadratic constraints: nonstrongly convex problems
- Data-Driven Mirror Descent with Input-Convex Neural Networks
- Discerning the linear convergence of ADMM for structured convex optimization through the lens of variational analysis
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- First-order methods in optimization
- Globally Convergent Type-I Anderson Acceleration for Nonsmooth Fixed-Point Iterations
- Halting time is predictable for large models: a universality property and average-case analysis
- How much data is sufficient to learn high-performing algorithms? generalization guarantees for data-driven algorithm design
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- Implicit Functions and Solution Mappings
- Infeasibility detection in the alternating direction method of multipliers for convex optimization
- Learning for Constrained Optimization: Identifying Optimal Active Constraint Sets
- Linear Convergence and Metric Selection for Douglas-Rachford Splitting and ADMM
- Local linear convergence of the alternating direction method of multipliers on quadratic or linear programs
- On Information and Sufficiency
- On the linear convergence of the alternating direction method of multipliers
- Online Mixed-Integer Optimization in Milliseconds
- Operator splitting for a homogeneous embedding of the linear complementarity problem
- Operator splitting performance estimation: tight contraction factors and optimal parameter selection
- OSQP: an operator splitting solver for quadratic programs
- Performance of first-order methods for smooth convex minimization: a novel approach
- Predictive control for linear and hybrid systems
- Robust Estimation of a Location Parameter
- Robust Kalman filtering for uncertain systems
- Safety Verification and Robustness Analysis of Neural Networks via Quadratic Constraints and Semidefinite Programming
- Tutorial on Amortized Optimization
- User-friendly tail bounds for sums of random matrices
This page was built for publication: Data-driven performance guarantees for classical and learned optimizers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6887368)
