A method for solving multi-extremal problems with non-convex constraints, that uses a priori information about estimates of the optimum

DOI10.1016/0041-5553(87)90115-7zbMath0648.90075OpenAlexW1983983769MaRDI QIDQ3793959

Dmitri L. Markin, Roman G. Strongin

Publication date: 1987

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(87)90115-7

zbMATH Keywords

non-convex constraintsa priori informationestimates of the optimummulti-extremal nonlinear programs

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31)

Related Items (4)

Adaptive global optimization based on a block-recursive dimensionality reduction scheme ⋮ An algorithm for solving global optimization problems with nonlinear constraints ⋮ A one-layer recurrent neural network for nonsmooth pseudoconvex optimization with quasiconvex inequality and affine equality constraints ⋮ Algorithms for multi-extremal mathematical programming problems employing the set of joint space-filling curves

This page was built for publication: A method for solving multi-extremal problems with non-convex constraints, that uses a priori information about estimates of the optimum