| |
ISSN 2234-8417 (Online)
ISSN 1598-5857 (Print)
|
| |
| |
 |
| |
|
| |
|
| |
 |
Table of Contents |
|
| |
|
| |
|
| |
|
| |
| |
 A superlinear $\mathcal{VU}$ space-decomposition algorithm for Semi-infinite constrained programming |
| |
|
By Ming Huang, Li-ping Pang, Yuan
..........1354 |
| |
|
|
| |
| |
|
|
 Generic
Number - 1354 |
| References
- 0 |
| Written
Date -
September 13th, 12 |
| Modified
Date -
September 13th, 12 |
| Downloaded
Counts - 1177 |
| Visited
Counts - 716 |
| |
| Original
File |
|
|
|
| Summary |
In this paper, semi-infinite constrained
programming, a class of constrained nonsmooth optimization problems,
are transformed into unconstrained nonsmooth convex programs under
the help of exact penalty function. The unconstrained objective
function which owns the primal-dual gradient structure has
connection with $\mathcal{VU}$-space decomposition. Then a
$\mathcal{VU}$-space decomposition method can be applied for solving
this unconstrained programs. Finally, the superlinear convergence
algorithm is proved under certain assumption. |
|
|
| |
|
| |
|
|
|
