Primal-dual interior-point methods for PDE-constrained optimization

被引:0
作者
Michael Ulbrich
Stefan Ulbrich
机构
[1] Zentrum Mathematik M1,Chair of Mathematical Optimization
[2] TU München,TU Darmstadt, Fachbereich Mathematik
[3] AG10: Nonlinear Optimization and Optimal Control,undefined
来源
Mathematical Programming | 2009年 / 117卷
关键词
Primal-dual interior point methods; PDE-constraints; Optimal control; Control constraints; Superlinear convergence; Global convergence; 90C51; 90C48; 49M15; 65K10;
D O I
暂无
中图分类号
学科分类号
摘要
This paper provides a detailed analysis of a primal-dual interior-point method for PDE-constrained optimization. Considered are optimal control problems with control constraints in Lp. It is shown that the developed primal-dual interior-point method converges globally and locally superlinearly. Not only the easier L∞-setting is analyzed, but also a more involved Lq-analysis, q < ∞, is presented. In L∞, the set of feasible controls contains interior points and the Fréchet differentiability of the perturbed optimality system can be shown. In the Lq-setting, which is highly relevant for PDE-constrained optimization, these nice properties are no longer available. Nevertheless, a convergence analysis is developed using refined techniques. In parti- cular, two-norm techniques and a smoothing step are required. The Lq-analysis with smoothing step yields global linear and local superlinear convergence, whereas the L∞-analysis without smoothing step yields only global linear convergence.
引用
收藏
页码:435 / 485
页数:50
相关论文
共 50 条
[21]   On the implementation of a quasi-Newton interior-point method for PDE-constrained optimization using finite element discretizations [J].
Petra, Cosmin G. ;
Salazar De Troya, Miguel ;
Petra, Noemi ;
Choi, Youngsoo ;
Oxberry, Geoffrey M. ;
Tortorelli, Daniel .
OPTIMIZATION METHODS & SOFTWARE, 2023, 38 (01) :59-90
[22]   A globally convergent primal-dual interior-point filter method for nonlinear programming [J].
Michael Ulbrich ;
Stefan Ulbrich ;
Luís N. Vicente .
Mathematical Programming, 2004, 100 :379-410
[23]   A Derivative-Free Regularized Primal-Dual Interior-Point Algorithm for Constrained Nonlinear Least Squares Problems [J].
Chen, Xi ;
Fan, Jinyan .
JOURNAL OF SCIENTIFIC COMPUTING, 2025, 103 (02)
[24]   A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties [J].
Xinwei Liu ;
Yaxiang Yuan .
Mathematical Programming, 2010, 125 :163-193
[25]   A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties [J].
Liu, Xinwei ;
Yuan, Yaxiang .
MATHEMATICAL PROGRAMMING, 2010, 125 (01) :163-193
[26]   Primal-dual interior-point method for linear optimization based on a kernel function with trigonometric growth term [J].
Fathi-Hafshejani, S. ;
Mansouri, H. ;
Peyghami, M. Reza ;
Chen, S. .
OPTIMIZATION, 2018, 67 (10) :1605-1630
[27]   On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function [J].
Choi, Bo Kyung ;
Lee, Gue Myung .
NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS, 2009, 71 (12) :E2628-E2640
[28]   A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent [J].
Bakhtiari, S ;
Tits, AL .
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2003, 25 (1-3) :17-38
[29]   A Simple Primal-Dual Feasible Interior-Point Method for Nonlinear Programming with Monotone Descent [J].
Sasan Bakhtiari ;
André L. Tits .
Computational Optimization and Applications, 2003, 25 :17-38
[30]   A PRIMAL-DUAL INTERIOR-POINT METHOD CAPABLE OF RAPIDLY DETECTING INFEASIBILITY FOR NONLINEAR PROGRAMS [J].
Dai, Yu-Hong ;
Liu, Xin-Wei ;
Sun, Jie .
JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2020, 16 (02) :1009-1035