A minimization algorithm for equilibrium problems with polyhedral constraints. (3rd May 2016)
- Record Type:
- Journal Article
- Title:
- A minimization algorithm for equilibrium problems with polyhedral constraints. (3rd May 2016)
- Main Title:
- A minimization algorithm for equilibrium problems with polyhedral constraints
- Authors:
- Cruz Neto, J.X.
Lopes, J.O.
Soares, P.A. - Abstract:
- Abstract : Our aim in this paper is to study an infeasible interior proximal method for solving equilibrium problems with polyhedral constrains in a quasiconvex setting. Under mild assumptions, we show that the sequence generated by our algorithm is well defined and it converges to a solution of the problem when regularization parameters converge to zero.
- Is Part Of:
- Optimization. Volume 65:Number 5(2016)
- Journal:
- Optimization
- Issue:
- Volume 65:Number 5(2016)
- Issue Display:
- Volume 65, Issue 5 (2016)
- Year:
- 2016
- Volume:
- 65
- Issue:
- 5
- Issue Sort Value:
- 2016-0065-0005-0000
- Page Start:
- 1061
- Page End:
- 1068
- Publication Date:
- 2016-05-03
- Subjects:
- equilibrium problem -- infeasible interior proximal point method -- second-order homogeneous distances -- generalized convexity
90C33 -- 47J25 -- 65K05 -- 90C26
Mathematical optimization -- Periodicals
519.7 - Journal URLs:
- http://www.tandfonline.com/toc/gopt20/current ↗
http://www.tandfonline.com/ ↗ - DOI:
- 10.1080/02331934.2015.1080702 ↗
- Languages:
- English
- ISSNs:
- 0233-1934
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 6275.100000
British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 2254.xml