Related papers: Interior point methods in optimal control problems…
An interior point method for the structural topology optimization is proposed. The linear systems arising in the method are solved by the conjugate gradient method preconditioned by geometric multigrid. The resulting method is then compared…
In this work, we will investigate the question of optimal control for bilinear systems with constrained endpoint. The optimal control will be characterized through a set of unconstrained minimization problems that approximate the former.…
Point sets matching problems can be handled by optimal transport. The mechanism behind it is that optimal transport recovers the point-to-point correspondence associated with the least curl deformation. Optimal transport is a special form…
This paper presents a novel convex optimization-based method for finding the globally optimal solutions of a class of mixed-integer non-convex optimal control problems. We consider problems with non-convex constraints that restrict the…
The focus in this paper is interior-point methods for bound-constrained nonlinear optimization, where the system of nonlinear equations that arise are solved with Newton's method. There is a trade-off between solving Newton systems…
The boundary control problem is a non-convex optimization and control problem in many scientific domains, including fluid mechanics, structural engineering, and heat transfer optimization. The aim is to find the optimal values for the…
Constraint satisfaction is a critical component in a wide range of engineering applications, including but not limited to safe multi-agent control and economic dispatch in power systems. This study explores violation-free distributed…
We introduce a family of hybrid discretisations for the numerical approximation of optimal control problems governed by the equations of immiscible displacement in porous media. The proposed schemes are based on mixed and discontinuous…
The aim of this paper is to solve linear semidefinite programs arising from higher-order Lasserre relaxations of unconstrained binary quadratic optimization problems. For this we use an interior point method with a preconditioned conjugate…
We propose the use of controlled perturbations to address the challenging question of optimal active-set prediction for interior point methods. Namely, in the context of linear programming, we consider perturbing the inequality…
In this work, we introduce an interior-point method that employs tensor decompositions to efficiently represent and manipulate the variables and constraints of semidefinite programs, targeting problems where the solutions may not be…
We consider strongly convex optimization problems with affine-type restrictions. We build dual problem and solve dual problem by Fast Gradient Method. We use primal-dual structure of this method to construct the solution of the primal…
In this study, we focus on the numerical solution method for the optimal control problem with equilibrium constraints (OCPEC).It is extremely challenging to solve OCPEC owing to the absence of constraint regularity and strictly feasible…
Interior-point methods offer a highly versatile framework for convex optimization that is effective in theory and practice. A key notion in their theory is that of a self-concordant barrier. We give a suitable generalization of…
The paper addresses an optimal control problem for a perturbed sweeping process of the rate-independent hysteresis type described by a controlled "play and stop" operator with separately controlled perturbations. This problem can be reduced…
In this paper we propose a new finite element method for solving elliptic optimal control problems with pointwise state constraints, including the distributed controls and the Dirichlet or Neumann boundary controls. The main idea is to use…
In this paper, a quadratic optimal control problem is considered for second-order parabolic PDEs with homogeneous Dirichlet boundary conditions, in which the "point" control function (depending only on time) constitutes a source term. These…
This paper focuses on optimal control problem for a class of discrete-time nonlinear systems. In practical applications, computation time is a crucial consideration when solving nonlinear optimal control problems, especially under real-time…
We propose a novel continuous-time algorithm for inequality-constrained convex optimization inspired by proportional-integral control. Unlike the popular primal-dual gradient dynamics, our method includes a proportional term to control the…
We propose a modified primal-dual method for general convex optimization problems with changing constraints. We obtain properties of Lagrangian saddle points for these problems which enable us to establish convergence of the proposed…