Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Bradley-Terry model  (1)
  • Interior-point methods  (1)
  • equidistant scoring  (1)
  • interior-point algorithms  (1)
  • 1
    Electronic Resource
    Electronic Resource
    Presolving in linear programming (1995)
    Springer
    Mathematical programming 71 (1995), S. 221-245 
    Details
    ISSN: 1436-4646
    Keywords: Linear programming ; Presolving ; Interior-point methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Most modern linear programming solvers analyze the LP problem before submitting it to optimization. Some examples are the solvers WHIZARD (Tomlin and Welch, 1983), OB1 (Lustig et al., 1994), OSL (Forrest and Tomlin, 1992), Sciconic (1990) and CPLEX (Bixby, 1994). The purpose of the presolve phase is to reduce the problem size and to discover whether the problem is unbounded or infeasible. In this paper we present a comprehensive survey of presolve methods. Moreover, we discuss the restoration procedure in detail, i.e., the procedure that undoes the presolve. Computational results on the NETLIB problems (Gay, 1985) are reported to illustrate the efficiency of the presolve methods.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01586000
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Paired comparisons with individual differences (1976)
    Springer
    Psychometrika 41 (1976), S. 141-157 
    Details
    ISSN: 1860-0980
    Keywords: Bradley-Terry model ; sufficiency ; individual parameters ; goodness of fit
    Source: Springer Online Journal Archives 1860-2000
    Topics: Psychology
    Notes: Abstract A model of Bradley-Terry type for paired comparisons is considered. In addition to the usual parameters, the model allows for individual parameters and corresponding parameters for the choice-alternatives. The model is applied to a set of data from a Danish investigation of the attitude of blue collar workers towards alternative social gains. The proposed model is finally compared to a model recently suggested by Schönemann and Wang.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02291835
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Sufficient statistics and latent trait models (1977)
    Springer
    Psychometrika 42 (1977), S. 69-81 
    Details
    ISSN: 1860-0980
    Keywords: logistic latent trait ; minimal sufficient statistic ; Rasch model ; equidistant scoring ; sufficiency
    Source: Springer Online Journal Archives 1860-2000
    Topics: Psychology
    Notes: Abstract For questionnaires with two answer categories, it has been proven in complete generality that if a minimal sufficient statistic exists for the individual parameter and if it is the same statistic for all values of the item parameters, then the raw score (or the number of correct answers) is the minimal sufficient statistic. It follows that the model must by of the Rasch type with logistic item characteristic curves and equal item-discriminating powers. This paper extends these results to multiple choice questionnaires. It is shown that the minimal sufficient statistic for the individual parameter is a function of the so-called score vector. It is also shown that the so-called equidistant scoring is the only scoring of a questionnaire that allows for a real valued sufficient statistic that is independent of the item parameters, if a certain ordering property for the sufficient statistic holds.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02293746
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    A Computational Study of the Homogeneous Algorithm for Large-scale Convex Optimization (1998)
    Springer
    Computational optimization and applications 10 (1998), S. 243-269 
    Details
    ISSN: 1573-2894
    Keywords: monotone complementarity problem ; homogeneous and self-dual model ; interior-point algorithms ; large-scale convex optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Recently the authors have proposed a homogeneous and self-dual algorithm for solving the monotone complementarity problem (MCP) [5]. The algorithm is a single phase interior-point type method; nevertheless, it yields either an approximate optimal solution or detects a possible infeasibility of the problem. In this paper we specialize the algorithm to the solution of general smooth convex optimization problems, which also possess nonlinear inequality constraints and free variables. We discuss an implementation of the algorithm for large-scale sparse convex optimization. Moreover, we present computational results for solving quadratically constrained quadratic programming and geometric programming problems, where some of the problems contain more than 100,000 constraints and variables. The results indicate that the proposed algorithm is also practically efficient.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1018369223322
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...