scientific article; zbMATH DE number 1786147

MaRDI QIDQ4547468zbMATH OpenFDO

Authors Mojca Indihar Štemberger, Miro Gradisar, H. Arsham

Publication date 23 November 2003

zbMATH Keywords

global optimizationlinearly constrained optimizationnonlinear programmingtight bounding continuous functions over polyhedrons

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Linearly constrained global optimization: a general solution algorithm with applications.
• Linearly constrained global optimization via piecewise-linear approximation
• Global optimal algorithm for linear programming problems subjected to nonlinear constraints
• A Globally Convergent Linearly Constrained Lagrangian Method for Nonlinear Optimization
• Constrained global optimization: algorithms and applications
• Linearly constrained global optimization and stochastic differential equations
• A globally convergent algorithm for nonlinearly constrained optimization problems
• A global linearization approach to solve nonlinear nonsmooth constrained programming problems
• New interval methods for constrained global optimization

Cited in

(5)

• Linearly constrained global optimization: a general solution algorithm with applications.
• Continuous global optimization over polyhedrons: A new introduction to optimization
• Optimisation of two variables function with linear inequalities constraints: contraction of the feasible region.
• scientific article; zbMATH DE number 2187089 (Why is no real title available?)
• A validation and verification tool for global optimization solvers

This page was built for publication:

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