Optimization Problems with Convex Epigraphs. Application to Optimal Control
نویسندگان
چکیده
For a class of infinite-dimensional minimization problems with nonlinear equality constraints, an iterative algorithm for finding global solutions is suggested. A key assumption is the convexity of the “epigraph”, a set in the product of the image spaces of the constraint and objective functions. A convexification method involving randomization is used. The algorithm is based on the extremal shift control principle due to N.N. Krasovskii. An application to a problem of optimal control for a bilinear control system is described.
منابع مشابه
ε - optimality conditions for composed convex optimization problems
The aim of the present paper is to provide a formula for the ε subdifferential of f +g ◦h different from the ones which can be found in the existent literature. Further we equivalently characterize this formula by using a so-called closedness type regularity condition expressed by means of the epigraphs of the conjugates of the functions involved. Even more, using the ε subdifferential formula ...
متن کاملConstrained Nonlinear Optimal Control via a Hybrid BA-SD
The non-convex behavior presented by nonlinear systems limits the application of classical optimization techniques to solve optimal control problems for these kinds of systems. This paper proposes a hybrid algorithm, namely BA-SD, by combining Bee algorithm (BA) with steepest descent (SD) method for numerically solving nonlinear optimal control (NOC) problems. The proposed algorithm includes th...
متن کاملDistributed MIN-MAX Optimization Application to Time-optimal Consensus: An Alternating Projection Approach
In this paper, we proposed an alternating projection based algorithm to solve a class of distributed MIN-MAX convex optimization problems. We firstly transform this MINMAX problem into the problem of searching for the minimum distance between some hyper-plane and the intersection of the epigraphs of convex functions. The Bregmans alternating method is employed in our algorithm to achieve the di...
متن کاملClosedness Type Regularity Conditions in Convex Optimization and Beyond
The closedness type regularity conditions have proven during the last decade to be viable alternatives to their more restrictive interiority type counterparts, in both convex optimization and different areas where it was successfully applied. In this review article we deand reconstruct some closedness type regularity conditions formulated by means of epigraphs and subdifferentials, respectively...
متن کاملEpigraphical splitting for solving constrained convex optimization problems with proximal tools – extended version
We propose a proximal approach to deal with a class of convex variational problems involving nonlinear constraints. A large family of constraints, proven to be effective in the solution of inverse problems, can be expressed as the lower level set of a sum of convex functions evaluated over different blocks of the linearly-transformed signal. For such constraints, the associated projection opera...
متن کامل