Search Results - (Author, Cooperation:C. J. Price)

Showing 1 - 6 results of 6, query time: 0.17s Refine Results
  1. 1
    S. Ramsden ; F. M. Richardson ; G. Josse ; M. S. Thomas ; C. Ellis ; C. Shakeshaft ; M. L. Seghier ; C. J. Price
    Nature Publishing Group (NPG)
    Published 2011
    Staff View
    Publication Date:
    2011-10-21
    Publisher:
    Nature Publishing Group (NPG)
    Print ISSN:
    0028-0836
    Electronic ISSN:
    1476-4687
    Topics:
    Biology
    Chemistry and Pharmacology
    Medicine
    Natural Sciences in General
    Physics
    Keywords:
    Adolescent ; Brain/anatomy & histology/*growth & development/*physiology ; Child ; Cross-Sectional Studies ; Functional Neuroimaging ; Health ; Humans ; Intelligence/*physiology ; Intelligence Tests ; Magnetic Resonance Imaging ; Speech/physiology ; Verbal Behavior/*physiology ; Verbal Learning/physiology
    Published by:
    Latest Papers from Table of Contents or Articles in Press
  2. 2
    S. Ramsden ; F. M. Richardson ; G. Josse ; M. S. Thomas ; C. Ellis ; C. Shakeshaft ; M. L. Seghier ; C. J. Price
    Nature Publishing Group (NPG)
    Published 2012
    Staff View
    Publication Date:
    2012-06-05
    Publisher:
    Nature Publishing Group (NPG)
    Print ISSN:
    0028-0836
    Electronic ISSN:
    1476-4687
    Topics:
    Biology
    Chemistry and Pharmacology
    Medicine
    Natural Sciences in General
    Physics
    Keywords:
    Adolescent ; Brain/anatomy & histology/*physiology ; Humans ; Intelligence/*physiology ; Intelligence Tests ; Verbal Learning/*physiology
    Published by:
    Latest Papers from Table of Contents or Articles in Press
  3. 3
    Price, C. J. ; Coope, I. D.
    Springer
    Published 1990
    Staff View
    ISSN:
    1572-9125
    Keywords:
    65K05 ; 90C30
    Source:
    Springer Online Journal Archives 1860-2000
    Topics:
    Mathematics
    Notes:
    Abstract An algorithm for semi-inifinite programming using sequential quadratic programming techniques together with anL ∞ exact penalty function is presented, and global convergence is shown. An important feature of the convergence proof is that it does not require an implicit function theorem to be applicable to the semi-infinite constraints; a much weaker assumption concerning the finiteness of the number of global maximizers of each semi-infinite constraint is sufficient. In contrast to proofs based on an implicit function theorem, this result is also valid for a large class ofC 1 problems.
    Type of Medium:
    Electronic Resource
    URL:
    Articles: DFG German National Licenses
  4. 4
    Coope, I. D. ; Price, C. J.
    Springer
    Published 1994
    Staff View
    ISSN:
    1573-2878
    Keywords:
    Nonlinear optimization ; exact penalty functions
    Source:
    Springer Online Journal Archives 1860-2000
    Topics:
    Mathematics
    Notes:
    Abstract A sequential quadratic programming algorithm for nonlinear programs using anl ∞-exact penalty function is described. Numerical results are also presented. These results show that the algorithm is competitive with other exact penalty function based algorithms and that the inclusion of the second penalty parameter can be advantageous.
    Type of Medium:
    Electronic Resource
    URL:
    Articles: DFG German National Licenses
  5. 5
    Price, C. J. ; Coope, I. D.
    Springer
    Published 1996
    Staff View
    ISSN:
    1573-2894
    Keywords:
    semi-infinite programming ; nonlinear optimisation ; L ∞ exact penalty function
    Source:
    Springer Online Journal Archives 1860-2000
    Topics:
    Computer Science
    Notes:
    Abstract A quasi-Newton algorithm for semi-infinite programming using an L ∞ exact penalty function is described, and numerical results are presented. Comparisons with three Newton algorithms and one other quasi-Newton algorithm show that the algorithm is very promising in practice.
    Type of Medium:
    Electronic Resource
    URL:
    Articles: DFG German National Licenses
  6. 6
    Coope, I. D. ; Price, C. J.
    Springer
    Published 2000
    Staff View
    ISSN:
    1573-2878
    Keywords:
    derivative free optimization ; positive basis methods ; convergence analysis ; frame based methods
    Source:
    Springer Online Journal Archives 1860-2000
    Topics:
    Mathematics
    Notes:
    Abstract This paper describes a wide class of direct search methods for unconstrained optimization, which make use of fragments of grids called frames. Convergence is shown under mild conditions which allow successive frames to be rotated, translated, and scaled relative to one another.
    Type of Medium:
    Electronic Resource
    URL:
    Articles: DFG German National Licenses