The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
In the present paper rather general penalty/barrier path-following methods (e.g. with p-th power penalties, logarithmic barriers, SUMT, exponential penalties) applied to linearly constrained convex optimization problems are studied. In particular, unlike in previous studies [1,11], here simultaneously different types of penalty/barrier embeddings are included. Together with the assumed 2nd order sufficient optimality conditions this required a significant change in proving the local existence of...
Penalty methods, augmented Lagrangian methods and Nitsche mortaring are well known numerical methods among the specialists in the related areas optimization and finite elements, respectively, but common aspects are rarely available. The aim of the present paper is to describe these methods from a unifying optimization perspective and to highlight some common features of them.
In this paper, properties of projection and penalty methods are studied in connection with control problems and their discretizations. In particular, the convergence of an interior-exterior penalty method applied to simple state constraints as well as the contraction behavior of projection mappings are analyzed. In this study, the focus is on the application of these methods to discretized control problem.
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.
Download Results (CSV)