scholarly journals Penalty function method for the minimal time crisis problem

2021 ◽  
Vol 71 ◽  
pp. 21-32
Author(s):  
Kenza Boumaza ◽  
Térence Bayen ◽  
Alain Rapaport

In this note, we propose a new method to approximate the minimal time crisis problem using an auxiliary control and a penalty function, and show its convergence to a solution to the original problem. The interest of this approach is illustrated on numerical examples for which optimal trajectories can leave and enter the crisis set tangentially.

1989 ◽  
Vol 2 (4) ◽  
pp. 251-265 ◽  
Author(s):  
An-qing Xing

This paper uses the penalty function method to solve constrained optimal control problems. Under suitable assumptions, we can solve a constrained optimal control problem by solving a sequence of unconstrained optimal control problems. In turn, the constrained solution to the main problem can be obtained as the limit of the solutions of the sequence. In using the penalty function method to solve constrained optimal control problems, it is usually assumed that each of the modified unconstrained optimal control problems has at least one solution. Here we establish an existence theorem for those problems. Two numerical examples are presented to demonstrate the findings.


Author(s):  
Zhiqing Meng ◽  
Min Jiang ◽  
Rui Shen ◽  
Leiyan Xu ◽  
Chuangyin Dang

2016 ◽  
Vol 4 (1) ◽  
pp. 87-96
Author(s):  
Yaqiong Duan ◽  
Shujun Lian

AbstractIn this paper, smoothing approximation to the square-root exact penalty functions is devised for inequality constrained optimization. It is shown that an approximately optimal solution of the smoothed penalty problem is an approximately optimal solution of the original problem. An algorithm based on the new smoothed penalty functions is proposed and shown to be convergent under mild conditions. Three numerical examples show that the algorithm is efficient.


Sign in / Sign up

Export Citation Format

Share Document