Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results |
| |
Authors: | J C Dodu T Eve M Minoux |
| |
Institution: | (1) EDF-Direction des Etudes et Recherches, Paris, France;(2) Université Paris VI, Paris, France |
| |
Abstract: | This paper describes an implementation of the so-calledproximal point algorithm for solving convex linearly constrained nonsmooth optimization problems. Contrary to other previous implementations of the same approach (which solve constrained nonsmooth problems as unconstrained problems via exact penalty function techniques), our implementation handles linear constraints explicitly (linear constraints being incorporated into the direction-finding subproblem). The relevance and efficiency of the approach is demonstrated through comparative computational experiments on many classical test problems from the literature, as well as on a series of large constrained dual transportation problems introduced and studied here for the first time. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|