The convexity principle and its applications

DOI10.1007/s00574-003-0003-6zbMath1059.49025OpenAlexW1965877998MaRDI QIDQ1416092

Boris T. Polyak

Publication date: 29 March 2004

Published in: Bulletin of the Brazilian Mathematical Society. New Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00574-003-0003-6

zbMATH Keywords

optimal controlconvexityzeros of polynomialsiterative methodsmathematical programmingnonlinear map\(\mu\)-analysiseigenvalues of perturbed matrices

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Set-valued and variational analysis (49J53) Real polynomials: location of zeros (26C10) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Attainable sets, reachability (93B03) Optimality conditions for problems involving ordinary differential equations (49K15) Convex sets without dimension restrictions (aspects of convex geometry) (52A05) Abstract inverse mapping and implicit function theorems involving nonlinear operators (47J07)

Related Items

Newton's method and its use in optimization, Convexity of the images of small balls through nonconvex multifunctions, Convexity of a small ball under quadratic map, On the Polyak convexity principle and its application to variational analysis, Convexity of reachable sets of nonlinear ordinary differential equations, On local convexity of quadratic transformations, Elliptic quadratic operator equations, Unnamed Item, Localizing vector optimization problems with application to welfare economics, Criteria for convexity of closed sets in Banach spaces, Newton-Kantorovich method and its global convergence