Skip to main content
SpringerLink
Log in

Improved bounds for optimal intervals in weakly constrained regression problems

  • Published:
Psychometrika Aims and scope Submit manuscript

Abstract

The solution of weakly constrained regression problems typically requires the iterative search, in a given interval, of a point where a certain function has a zero derivative. This note deals with improved bounds for the interval to be searched.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Greenacre, M. J., & Browne, M. W. (1986). An efficient alternating least-squares algorithm to perform multidimensional unfolding.Psychometrika, 51, 241–250.

    Google Scholar 

  • ten Berge, J. M. F. (1991). A general solution for a class of weakly constrained linear regression problems.Psychometrika, 56, 601–609.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Psychology, University of Groningen, Grote Kruisstraat 2/1, 9712 TS, Groningen, The Netherlands

    Jos M. F. ten Berge

Authors
  1. Jos M. F. ten Berge
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

ten Berge, J.M.F. Improved bounds for optimal intervals in weakly constrained regression problems. Psychometrika 61, 695–696 (1996). https://doi.org/10.1007/BF02294043

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02294043

Key words

Search

Navigation