Prediction-correction alternating direction method for a class of constrained min-max problems (Q1956529)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Prediction-correction alternating direction method for a class of constrained min-max problems |
scientific article; zbMATH DE number 5790129
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Prediction-correction alternating direction method for a class of constrained min-max problems |
scientific article; zbMATH DE number 5790129 |
Statements
Prediction-correction alternating direction method for a class of constrained min-max problems (English)
0 references
22 September 2010
0 references
The authors consider a class of constrained min-max problems of the following form: \[ \min_{x\in X,z\in Z}\Biggl\{\max_{y\in Y}\,y^Tx\mid Ax+ Bz= b\Biggr\}. \] These problems can be solved by projection type prediction-correction methods. The authors use an alternating direction method to obtain components of the predictor one by one and prove the global convergence of the method. Numerical results are given.
0 references
nonlinear programming
0 references
constrained minimum distance problem
0 references
linear variational inequality
0 references
projection and contraction methods
0 references
0 references
0 references
0 references
0.7541478872299194
0 references
0.7516027688980103
0 references