Search Results - subject:"Subgradient"

A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process

Mao, Kun; Pan, Quan-ke; Pang, Xinfu; Chai, Tianyou - In: European Journal of Operational Research 236 (2014) 1, pp. 51-60

decomposed subproblems in iterations. Furthermore, an improved subgradient level algorithm with global convergence is developed …

Persistent link: https://www.econbiz.de/10010753510

A vicosity method with no spectral radius requirements for the split common fixed point problem

Maingé, Paul-Emile - In: European journal of operational research : EJOR 235 (2014) 1, pp. 17-27

Persistent link: https://www.econbiz.de/10010361415

A novel Lagrangian relaxtaion approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process

Mao, Kun; Pan, Quan-ke; Pang, Xinfu; Chai, Tianyou - In: European journal of operational research : EJOR 236 (2014) 1, pp. 51-60

Persistent link: https://www.econbiz.de/10010361780

The strategic berth template problem

Imai, Akio; Yamakawa, Yukiko; Huang, Kuancheng - In: Transportation research / E : an international journal 72 (2014), pp. 77-100

Persistent link: https://www.econbiz.de/10010466689

Computing Normalized Equilibria in Convex-Concave Games

Flam, Sjur; Ruszczynski, A. - 2006

This paper considers a fairly large class of noncooperative games in which strategies are jointly constrained. When what is called the Ky Fan or Nikaido-Isoda function is convex-concave, selected Nash equilibria correspond to diagonal saddle points of that function. This feature is exploited to...

Persistent link: https://www.econbiz.de/10013208501

Computing Normalized Equilibria in Convex-Concave Games

Flåm, Sjur Didrik; Ruszczynski, A. - Institutt for Økonomi, Universitetet i Bergen - 2006

- variational inequalities, exact penalty, subgradient projection, proximal point algorithm, partial regularization, saddle points … regularizations, relaxed subgradient projections and averages of proposed solutions. These algorithms are specialized versions of … especially, to splitting methods [8]. Finally, the last bullet indicates that subgradient projections might oﬀer a good avenue [3 …

Persistent link: https://www.econbiz.de/10008925668

A derivative-free approximate gradient sampling algorithm for finite minimax problems

Hare, W.; Nutini, J. - In: Computational Optimization and Applications 56 (2013) 1, pp. 1-38

In this paper we present a derivative-free optimization algorithm for finite minimax problems. The algorithm calculates an approximate gradient for each of the active functions of the finite max function and uses these to generate an approximate subdifferential. The negative projection of 0 onto...

Persistent link: https://www.econbiz.de/10010998249

A subgradient method for multiobjective optimization

Neto, J. Cruz; Silva, G.; Ferreira, O.; Lopes, J. - In: Computational Optimization and Applications 54 (2013) 3, pp. 461-472

this paper. This method extends to the multiobjective case of the classical subgradient method for real-valued minimization …

Persistent link: https://www.econbiz.de/10010998264

An acceleration scheme for cyclic subgradient projections method

Nikazad, Touraj; Abbasi, Mokhtar - In: Computational Optimization and Applications 54 (2013) 1, pp. 77-91

fully sequential cyclic subgradient projections method. A convergence proof is presented. The advantage of using this …

Persistent link: https://www.econbiz.de/10010998347

Image collection planning for KOrea Multi-Purpose SATellite-2

Jang, Jinbong; Choi, Jiwoong; Bae, Hee-Jin; Choi, In-Chan - In: European Journal of Operational Research 230 (2013) 1, pp. 190-199

Lagrangian relaxation and subgradient methods. We also present the results of our computational experiment based on randomly …

Persistent link: https://www.econbiz.de/10010666100