نتایج جستجو برای: polak

تعداد نتایج: 361  

1996
Craig T. Lawrence

A simple scheme is proposed for handling nonlinear equality constraints in the context of a previously introduced sequential quadratic programming (SQP) algorithm for inequality constrained problems, generating iterates satisfying the constraints. The key is an idea due to Mayne and Polak (Math. Progr., vol. 11, pp. 67{80, 1976) by which nonlinear equality constraints are treated as \"-type con...

Journal: :BMGN - Low Countries Historical Review 1995

Journal: :Maandblad Voor Accountancy en Bedrijfseconomie 1947

Journal: :PLoS Clinical Trials 2006
Thorkild I. A Sørensen Philippe Boutin Moira A Taylor Lesli H Larsen Camilla Verdich Liselotte Petersen Claus Holst Søren M Echwald Christian Dina Søren Toubro Martin Petersen Jan Polak Karine Clément J. Alfredo Martínez Dominique Langin Jean-Michel Oppert Vladimir Stich Ian Macdonald Peter Arner Wim H. M Saris Oluf Pedersen Arne Astrup Philippe Froguel

Thorkild I. A. Sørensen, Philippe Boutin, Moira A. Taylor, Lesli H. Larsen, Camilla Verdich, Liselotte Petersen, Claus Holst, Søren M. Echwald, Christian Dina, Søren Toubro, Martin Petersen, Jan Polak, Karine Clément, J. Alfredo Martı́nez, Dominique Langin, Jean-Michel Oppert, Vladimir Stich, Ian Macdonald, Peter Arner, Wim H. M Saris, Oluf Pedersen, Arne Astrup, Philippe Froguel, The NUGENOB Co...

2010
Ben Polak

This introduces the symposium on judgment aggregation. The theory of judgment aggregation asks how several individuals’judgments on some logically connected propositions can be aggregated into consistent collective judgments. The aim of this introduction is to show how ideas from the familiar theory of preference aggregation can be extended to this more general case. We …rst translate a proof o...

Journal: :Math. Comput. 2008
Zeng Xin Wei Guoyin Li Liqun Qi

We propose two algorithms for nonconvex unconstrained optimization problems that employ Polak-Ribière-Polyak conjugate gradient formula and new inexact line search techniques. We show that the new algorithms converge globally if the function to be minimized has Lipschitz continuous gradients. Preliminary numerical results show that the proposed methods for particularly chosen line search condit...

2009
John E. W. Mayhew Neil A. Thacker

The original back-propagation methods were plagued with variable parameters which affected both the convergence properties of the training and the generalisation abilities of the resulting network. These parameters presented many difficulties when attempting to use these networks to solve particular mapping problems. A combination of established numerical minimisation methods (Polak-Ribiere Con...

2015
L. Demšar T. Polak D. Kovačević Dragan Kovačević

1 Doc. dr. sc. Jelka Pleadin, znanstveni savjetnik, Hrvatski veterinarski institut, Laboratorij za analitičku kemiju, Savska cesta 143, 10 000 Zagreb; 2 prof. dr. sc. Lea Demšar, izvanredni profesor; doc. dr. sc. Tomaž Polak, docent, Univerza v Ljubljani, Biotehniška fakulteta, Jamnikarjeva 101, 1000 Ljubljana; 3 prof. dr. sc. Dragan Kovačević, redoviti profesor, Prehrambeno-tehnološki fakultet...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید