Characterization of the stability of a minimization problem associated with a particular perturbation function. (Caractérisation de la stabilité d'un problème de minimisation associé à une fonction de perturbation particulière.)
To overcome the somewhat artificial difficulties in classical optimization theory concerning the existence and stability of minimizers, a new setting of constrained optimization problems (called problems with tolerance) is proposed using given proximity structures to define the neighbourhoods of sets. The infimum and the so-called minimizing filter are then defined by means of level sets created by these neighbourhoods, which also reflects the engineering approach to constrained optimization problems....
A sequence of optimal control problems for systems governed by linear hyperbolic equations with the nonhomogeneous Neumann boundary conditions is considered. The integral cost functionals and the differential operators in the equations depend on the parameter k. We deal with the limit behaviour, as k → ∞, of the sequence of optimal solutions using the notions of G- and Γ-convergences. The conditions under which this sequence converges to an optimal solution for the limit problem are given.
This paper characterizes completely the behavior of the logarithmic barrier method under a standard second order condition, strict (multivalued) complementarity and MFCQ at a local minimizer. We present direct proofs, based on certain key estimates and few well–known facts on linear and parametric programming, in order to verify existence and Lipschitzian convergence of local primal-dual solutions without applying additionally technical tools arising from Newton–techniques.
Convergence results for two Lagrange-Newton-type methods of solving optimal control problems are presented. It is shown how the methods can be applied to a class of optimal control problems for nonlinear ODEs, subject to mixed control-state constraints. The first method reduces to an SQP algorithm. It does not require any information on the structure of the optimal solution. The other one is the shooting method, where information on the structure of the optimal solution is exploited. In each case,...