IDEAS home Printed from https://ideas.repec.org/a/spr/cejnor/v33y2025i1d10.1007_s10100-024-00924-1.html
   My bibliography  Save this article

On the identity of two solution algorithms of the ‘improved normalized squared differences’ matrix adjustment model

Author

Listed:
  • Tamas Revesz

    (Corvinus University of Budapest)

Abstract

The paper is a supplement for an article recently published in this journal. That paper proved that if the sign-preservation requirement is dropped then the solution of the so-called improved normalized squared differences (INSD) two-directional matrix adjustment model is the same as the result of the ‘additive correction iteration algorithm’ which the author has been using successfully for decades. It also argued that if the sign-preservation requirement is dropped then the iteration procedure suggested by the authors of the INSD-model boils down to the same algorithm. Since the formal proof of this statement was not available at the time, in this paper the author duly publishes the three-and-a-half pages long proof he elaborated. In the conclusion the merit of this and similar, yet barely rigorously analysed iteration algorithms and the possible useful extensions are also outlined.

Suggested Citation

  • Tamas Revesz, 2025. "On the identity of two solution algorithms of the ‘improved normalized squared differences’ matrix adjustment model," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 33(1), pages 315-332, March.
  • Handle: RePEc:spr:cejnor:v:33:y:2025:i:1:d:10.1007_s10100-024-00924-1
    DOI: 10.1007/s10100-024-00924-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10100-024-00924-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10100-024-00924-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:cejnor:v:33:y:2025:i:1:d:10.1007_s10100-024-00924-1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.