Supporting global numerical optimization of rational functions by generic symbolic convexity tests

DOI10.1007/978-3-642-15274-0_19MaRDI QIDQ3589077zbMATHOpenAlexFDO

Authors Thomas Sturm, Stefan Vigerske, Winfried Neun

Publication date 10 September 2010

Published in Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15274-0_19

zbMATH Keywords

convex functionsimplementationreal quantifier eliminationReducenonlinear global optimizationhybrid symbolic-numeric computation

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Symbolic computation and algebraic computation (68W30)

Recommendations

• An algorithm of global optimization for rational functions with rational constraints
• Convexity and concavity detection in computational graphs: tree walks for convexity assessment
• Minimizing the sum of many rational functions
• Matrix inequalities: A symbolic procedure to determine convexity automatically
• On the complexity of detecting convexity over a box

Cites work

• scientific article; zbMATH DE number 1101647 (Why is no real title available?)
• scientific article; zbMATH DE number 3053259 (Why is no real title available?)
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Convexity and concavity detection in computational graphs: tree walks for convexity assessment
• Efficient Calculation of Bounds on Spectra of Hessian Matrices
• Global optimization in engineering design
• Investigating Generic Methods to Solve Hopf Bifurcation Problems in Algebraic Biology
• Investigating algebraic and logical algorithms to solve Hopf bifurcation problems in algebraic biology
• MINLPLib -- a collection of test models for mixed-integer nonlinear programming
• Numerical Optimization
• On the combinatorial and algebraic complexity of quantifier elimination
• Optimization of the Design and Partial-Load Operation of Power Plants Using Mixed-Integer Nonlinear Programming
• Partial cylindrical algebraic decomposition for quantifier elimination
• Quantifier elimination for real algebra -- the quadratic case and beyond
• Real quantifier elimination is doubly exponential
• Rigorous convex underestimators for general twice-differentiable problems
• The complexity of linear problems in fields

Cited in

(5)

• SUSPECT: MINLP special structure detector for Pyomo
• Symbolic computation of Fenchel conjugates
• A mechanical method for isolating locally optimal points of certain radical functions
• Global optimization of rational functions: a semidefinite programming approach
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations

Describes a project that uses

Uses Software

• QEPCAD
• REDUCE
• REDLOG
• MINLPLib
• Excel
• COPS
• FrontLine

This page was built for publication: Supporting global numerical optimization of rational functions by generic symbolic convexity tests

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