Transforming optimization problems into disciplined convex programming form

DOI10.1007/978-3-031-66997-2_11MaRDI QIDQ6648168zbMATH OpenFDO

Authors Ramon Fernández Mir, Paul B. Jackson, Siddharth Bhat, Andrés Goens, Tobias Grosser

Publication date 4 December 2024

Full work available at URL https://doi.org/10.1007/978-3-031-66997-2_11

Mathematics Subject Classification ID

Computer science support for mathematical research and practice (68Vxx)

Cites work

• A higher-order implementation of rewriting
• Beyond Notations: Hygienic Macro Expansion for Theorem Proving Languages
• Congruence closure in intensional type theory
• CVXPY: a Python-embedded modeling language for convex optimization
• Disciplined convex programming
• Disciplined geometric programming
• Disciplined quasiconvex programming
• Efficiency of a Good But Not Linear Set Union Algorithm
• Efficient E-Matching for SMT Solvers
• Equality saturation
• Fast Decision Procedures Based on Congruence Closure
• scientific article; zbMATH DE number 1489799 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
• Interval arithmetic: from principles to implementation
• Simplify: a theorem prover for program checking
• Term Rewriting and Applications
• The interior-point revolution in optimization: History, recent developments, and lasting consequences
• The Lean 4 theorem prover and programming language
• Verified reductions for optimization
• Verifying Nonlinear Real Formulas Via Sums of Squares

This page was built for publication: Transforming optimization problems into disciplined convex programming form

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6648168)