Showing 1 - 10 of 44
Based on the classic augmented Lagrangian multiplier method, we propose, analyze and test an algorithm for solving a class of equality-constrained non-smooth optimization problems (chiefly but not necessarily convex programs) with a particular structure. The algorithm effectively combines an...
Persistent link: https://www.econbiz.de/10010896527
We develop a globalized Proximal Newton method for composite and possibly non-convex minimization problems in Hilbert spaces. Additionally, we impose less restrictive assumptions on the composite objective functional considering differentiability and convexity than in existing theory. As far as...
Persistent link: https://www.econbiz.de/10015081219
We consider proximal Newton methods with an inexact computation of update steps. To this end, we introduce two inexactness criteria which characterize sufficient accuracy of these update step and with the aid of these investigate global convergence and local acceleration of our method. The...
Persistent link: https://www.econbiz.de/10015097385
Persistent link: https://www.econbiz.de/10008533947
We consider proximal Newton methods with an inexact computation of update steps. To this end, we introduce two inexactness criteria which characterize sufficient accuracy of these update step and with the aid of these investigate global convergence and local acceleration of our method. The...
Persistent link: https://www.econbiz.de/10015403578
The proximal method is a standard regularization approach in optimization. Practical implementations of this algorithm require (i) an algorithm to compute the proximal point, (ii) a rule to stop this algorithm, (iii) an update formula for the proximal parameter. In this work we focus...
Persistent link: https://www.econbiz.de/10010998309
Persistent link: https://www.econbiz.de/10004999515
We analyze optimal control problems for two-phase Navier-Stokes equations with surface tension. Based on Lp-maximal regularity of the underlying linear problem and recent well-posedness results of the problem for sufficiently small data we show the differentiability of the solution with respect...
Persistent link: https://www.econbiz.de/10015192108
The combinatorial integral approximation (CIA) decomposition suggests solving mixed-integer optimal control problems by solving one continuous nonlinear control problem and one mixed-integer linear program (MILP). Unrealistic frequent switching can be avoided by adding a constraint on the total...
Persistent link: https://www.econbiz.de/10014503535
In this paper we apply an augmented Lagrange method to a class of semilinear elliptic optimal control problems with pointwise state constraints. We show strong convergence of subsequences of the primal variables to a local solution of the original problem as well as weak convergence of the...
Persistent link: https://www.econbiz.de/10014503944