Local programming.
From MaRDI portal
The paper deals with local programming problems with the additional constraint \(\| x-a\| \leq\varepsilon\). It turns out that if \(a\) is a regular point of the original problem and \({\varepsilon}>0\) is sufficiently small, these problems behave as convex ones, even though neither the objective function nor the constraints are assumed to be convex. The duality theory for local programming problems is developed.
Recommendations
Cited in
(9)- Local convexity conditions for reachability tubes of distributed control systems
- Asymptotic behaviour of controllability gramians and convexity of small-time reachable sets
- On the convexity of the reachable set with respect to a part of coordinates at small time intervals
- THE LIMITS OF APPLICABILITY OF THE LINEARIZATION METHOD IN CALCULATING SMALL–TIME REACHABLE SETS
- Gradient projection and conditional gradient methods for constrained nonconvex minimization
- A historical essay on the scientific school of V. A. Yakubovich
- Localizing vector optimization problems with application to welfare economics
- Convexity of a small ball under quadratic map
- The Dines theorem and some other properties of quadratic mappings
This page was built for publication: Local programming.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1395207)