#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2009

2017

- This year (3)
- Last 5 years (13)
- Last 10 years (18)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Hans Joachim Ferreau, Christian Kirches, Andreas Potschka, Hans Georg Bock, Moritz Diehl
- Math. Program. Comput.
- 2014

Parametric Active Set Methods (PASM) are a relatively new class of methods to solve convex Quadratic Programming (QP) problems. They are based on tracing the solution along a linear homotopy between a QP with known solution and the QP to be solved. We explicitly identify numerical challenges in PASM and develop strategies to meet these challenges. To… (More)

- Andreas Potschka, Filip Logist, Jan F. M. Van Impe, Hans Georg Bock
- Numerical Algorithms
- 2010

In this paper we present a deterministic method for tracing the Pareto frontier in non-linear bi-objective optimization problems with equality and inequality constraints. We reformulate the bi-objective optimization problem as a parametric single-objective optimization problem with an additional Normalized Normal Equality Constraint (NNEC) similar to the… (More)

- A. Schmidt, Andreas Potschka, Stefan Körkel, Hans Georg Bock
- SIAM J. Scientific Computing
- 2013

In this article we consider model reduction via proper orthogonal decomposition (POD) and its application to parameter estimation problems constrained by parabolic PDEs. We use a first discretize then optimize approach to solve the parameter estimation problem and show that the use of derivative information in the reduced-order model is important. We… (More)

- Andreas Potschka, Hans Georg Bock, Johannes P. Schlöder
- Optimization Methods and Software
- 2009

- F. Lendersa, A. Potschka
- 2016

We describe trlib, a library that implements a variant of Gould’s Generalized Lanczos method (Gould et al. in SIAM J. Opt. 9(2), 504–525, 1999) for solving the trust region problem. Our implementation has several distinct features that set it apart from preexisting ones. We implement both conjugate gradient (CG) and Lanczos iterations for assembly of Krylov… (More)

Combinatorial and logic constraints arising in a number of challenging optimization applications can be formulated as vanishing constraints. Quadratic programs with vanishing constraints (QPVCs) then arise as subproblems during the numerical solution of such problems using algorithms of the Sequential Quadratic Programming type. QPVCs are nonconvex problems… (More)

- A. POTSCHKA
- 2009

We investigate an iterative method for the solution of time-periodic parabolic PDE constrained optimization problems. It is an inexact Sequential Quadratic Programming (iSQP) method based on the Newton-Picard approach. We present and analyze a linear quadratic model problem and prove optimal mesh-independent convergence rates. Additionally, we propose a… (More)

- Clemens Lindscheid, Daniel Haßkerl, Andreas Meyer, Andreas Potschka, Hans Georg Bock, Sebastian Engell
- 2016 IEEE Conference on Control Applications (CCA…
- 2016

For the widespread application of nonlinear model-predictive control (NMPC) in the chemical industry, the computational effort that is required for the solution of the underlying resulting nonlinear dynamic optimization problems is a major obstacle. For complex process models and long prediction and control horizons, the computation times lead to large… (More)