Approximate proximal point methods for convex programming problems
Conference
·
OSTI ID:35979
We study proximal point methods for the finite dimensional convex programming problem minimize f(x) such that x {element_of} C, where f : dom f {contained_in} RIR is a proper convex function and C {contained_in} R is a closed convex set.
- OSTI ID:
- 35979
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
An interior-point method for fractional programs with convex constraints
Multiparameter long-step interior methods for convex problems
Approximations for generalized bilevel programming problem
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36163
Multiparameter long-step interior methods for convex problems
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36338
Approximations for generalized bilevel programming problem
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36302