Optimization algorithms based on solving an equation which contains a reachability function

MaRDI QIDQ1112729zbMATH OpenFDO

Authors Anatoly Tsirlin

Publication date 1988

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

constrained optimizationreachability function

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Review text

The solution of constrained optimization problems can be reduced to the solution of a nonclassical equation containing the reachability function of an auxiliary problem of unconstrained optimization. By this approach it is possible to select the structure of the auxiliary problem and the sequence of recalculation of the vector of undetermined parameters that occur in the objective function of this problem.

Recommendations

• scientific article; zbMATH DE number 124136
• A general method for solving constrained optimization problems
• Solving reachability problems by a scalable constrained optimization method
• An approach to the solution of nonlinear unconstrained optimization problems
• scientific article; zbMATH DE number 4183191

Cited in

(3)

• Solving reachability problems by a scalable constrained optimization method
• Algorithm for solving partially - linear optimization problems obtained by getting maximum of functions
• Set covering-based surrogate approach for solving sup-\({\mathcal{T}}\) equation constrained optimization problems

This page was built for publication: Optimization algorithms based on solving an equation which contains a reachability function

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