Proximal point approach and approximation of variational inequalities

SIAM Journal on Control and Optimization

Volumn 39, Issue 4, 2000, Pages 1136-1159

  Kaplan, A ^a   Tichatschke, R ^a  

^a UNIVERSITY OF TRIER   (Germany)

Author keywords

Convex programming; Monotone operators; Proximal point methods; Variational inequalities; Weak regularization

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; OPTIMIZATION;

PROXIMAL POINT APPROACH; VARIATIONAL INEQUALITIES;

PROBLEM SOLVING;

EID: 0034433934     PISSN: 03630129     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0363012998333116     Document Type: Article

References (42)

1. Penalization in non-classical convex programming via variational convergence
2. On a method for convex programs using a symmetrical modification of the Lagrange function
3. Numerical methods for non-differentiable convex optimization
4. Penalty-proximal methods in convex programming
5. Partial proximal minimization algorithms for convex programming
6. A proximal-based decomposition method for convex minimization problems
7. Approximate iterations in Bregman-function-based proximal algorithms
8. On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
9. The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with applications to the traffic equilibrium problem
10. A generalization of the proximal point algorithm
11. Regularized penalty methods for ill-posed optimal control problems with elliptic equations. I. Distributed control with bounded control set and state constraints
12. Regularized penalty methods for ill-posed optimal control problems with elliptic equations. II. Distributed and boundary control with unbounded control set and state constraints
13. Primal-dual proximal point algorithm for linearly constrained convex programming problems
14. Algorithm for convex programming using smoothing of exact penalty functions
15. Stable methods for ill-posed variational problems
16. Path-following proximal approach for solving ill-posed convex semi-infinite programming problems
17. Prox-regularization and solution of ill-posed variational inequalities
18. Regularized penalty method for non-coercive parabolic optimal control problems
19. Multi-step proximal method for variational inequalities with monotone operators
20. Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
21. Coupling optimization methods and variational convergence
22. The proximal algorithm
23. An approach to variable metric bundle methods
24. Asymptotic convergence analysis of the proximal point algorithm
25. Régularisation d'inéquations variationelles par approximations successives
26. A quasi-second-order proximal bundle algorithm
27. Convergence of convex sets and of solutions of variational inequalities
28. Weak convergence of the successive approximaions for nonexpansive mappings in Banach spaces
29. On the maximality of sums of nonlinear monotone operators
30. Monotone operators and the proximal point algorithm
31. Augmented Lagrange multiplier functions and applications of the proximal point algorithm in convex programming
32. A hybrid projection-proximal point algorithm
33. Partial inverse of a monotone operator
34. Application of the method of partial inverses to convex programming: Decomposition
35. Implementing proximal point methods for linear programming