Supporting global numerical optimization of rational functions by generic symbolic convexity tests
DOI10.1007/978-3-642-15274-0_19zbMATH Open1290.65053OpenAlexW1495020149MaRDI QIDQ3589077FDOQ3589077
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
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
convex functionsimplementationreal quantifier eliminationReducenonlinear global optimizationhybrid symbolic-numeric computation
Numerical optimization and variational techniques (65K10) Symbolic computation and algebraic computation (68W30)
Cites Work
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- Numerical Optimization
- Partial cylindrical algebraic decomposition for quantifier elimination
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Efficient Calculation of Bounds on Spectra of Hessian Matrices
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- On the combinatorial and algebraic complexity of quantifier elimination
- The complexity of linear problems in fields
- Real quantifier elimination is doubly exponential
- Investigating Generic Methods to Solve Hopf Bifurcation Problems in Algebraic Biology
- Investigating algebraic and logical algorithms to solve Hopf bifurcation problems in algebraic biology
- Quantifier elimination for real algebra -- the quadratic case and beyond
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rigorous convex underestimators for general twice-differentiable problems
- Convexity and concavity detection in computational graphs: tree walks for convexity assessment
- Global optimization in engineering design
- Optimization of the Design and Partial-Load Operation of Power Plants Using Mixed-Integer Nonlinear Programming
Cited In (4)
- SUSPECT: MINLP special structure detector for Pyomo
- 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
Uses Software
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)
