A successive quadratic programming method for a class of constrained nonsmooth optimization problems |
| |
Authors: | Masao Fukushima |
| |
Institution: | (1) Department of Applied Mathematics and Physics, Faculty of Engineering, Kyoto University, 606 Kyoto, Japan |
| |
Abstract: | In this paper we present an algorithm for solving nonlinear programming problems where the objective function contains a possibly nonsmooth convex term. The algorithm successively solves direction finding subproblems which are quadratic programming problems constructed by exploiting the special feature of the objective function. An exact penalty function is used to determine a step-size, once a search direction thus obtained is judged to yield a sufficient reduction in the penalty function value. The penalty parameter is adjusted to a suitable value automatically. Under appropriate assumptions, the algorithm is shown to produce an approximate optimal solution to the problem with any desirable accuracy in a finite number of iterations. |
| |
Keywords: | Nonsmooth optimization subgradient -subgradient" target="_blank">gif" alt="epsi" align="BASELINE" BORDER="0">-subgradient exact penalty function successive quadratic programming |
本文献已被 SpringerLink 等数据库收录! |