Transforming optimization problems into disciplined convex programming form
From MaRDI portal
Publication:6648168
DOI10.1007/978-3-031-66997-2_11MaRDI QIDQ6648168
Ramon Fernández Mir, Andrés Goens, Paul B. Jackson, Siddharth Bhat, Tobias Grosser
Publication date: 4 December 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A higher-order implementation of rewriting
- The Lean 4 theorem prover and programming language
- Disciplined quasiconvex programming
- Disciplined geometric programming
- CVXPY: A Python-Embedded Modeling Language for Convex Optimization
- Congruence Closure in Intensional Type Theory
- Interval arithmetic
- Verifying Nonlinear Real Formulas Via Sums of Squares
- Simplify: a theorem prover for program checking
- Efficient E-Matching for SMT Solvers
- Fast Decision Procedures Based on Congruence Closure
- Efficiency of a Good But Not Linear Set Union Algorithm
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- The interior-point revolution in optimization: History, recent developments, and lasting consequences
- Beyond Notations: Hygienic Macro Expansion for Theorem Proving Languages
- Equality saturation
- Term Rewriting and Applications
- Verified reductions for optimization
This page was built for publication: Transforming optimization problems into disciplined convex programming form
