Skip to main content
  • Home
  • Development
  • Documentation
  • Donate
  • Operational login
  • Browse the archive

swh logo
SoftwareHeritage
Software
Heritage
Archive
Features
  • Search

  • Downloads

  • Save code now

  • Add forge now

  • Help

Revision a6e1bd2af35197fecce13a4682ed3be2f1acc6a1 authored by Roger Koenker on 16 August 2015, 00:00:00 UTC, committed by Gabor Csardi on 16 August 2015, 00:00:00 UTC
version 5.18
1 parent 8361897
  • Files
  • Changes
  • d2274b7
  • /
  • man
  • /
  • nlrq.control.Rd
Raw File Download

To reference or cite the objects present in the Software Heritage archive, permalinks based on SoftWare Hash IDentifiers (SWHIDs) must be used.
Select below a type of object currently browsed in order to display its associated SWHID and permalink.

  • revision
  • directory
  • content
revision badge
swh:1:rev:a6e1bd2af35197fecce13a4682ed3be2f1acc6a1
directory badge
swh:1:dir:5c347e8c27066c57b5a5ba25abf248cdc5c3f903
content badge
swh:1:cnt:c3e4dddf03e7be5f2a744423e9c13f080af117c1

This interface enables to generate software citations, provided that the root directory of browsed objects contains a citation.cff or codemeta.json file.
Select below a type of object currently browsed in order to generate citations for them.

  • revision
  • directory
  • content
Generate software citation in BibTex format (requires biblatex-software package)
Generating citation ...
Generate software citation in BibTex format (requires biblatex-software package)
Generating citation ...
Generate software citation in BibTex format (requires biblatex-software package)
Generating citation ...
nlrq.control.Rd
\name{nlrq.control}
\alias{nlrq.control}
\title{ Set control parameters for nlrq }
\description{
Set algorithmic parameters for nlrq (nonlinear quantile regression function)
}
\usage{
nlrq.control(maxiter=100, k=2, InitialStepSize = 1, big=1e+20, eps=1e-07, beta=0.97)
}
\arguments{
  \item{maxiter}{maximum number of allowed iterations}
  \item{k}{the number of iterations of the Meketon algorithm to be calculated 
	in each step, usually 2 is reasonable, occasionally it may be helpful 
	to set k=1 }
  \item{InitialStepSize}{ Starting value in \code{optim} to determine the step
	length of iterations.  The default value of 1 is sometimes too optimistic.
	In such cases, the value 0 forces optim to just barely stick its toe in
	the water.}
  \item{big}{ a large scalar}
  \item{eps}{ tolerance for convergence of the algorithm }
  \item{beta}{ a shrinkage parameter which controls the recentering process 
	in the interior point algorithm. }
}
\seealso{  \code{\link{nlrq}} }

\keyword{ environment}
The diff you're trying to view is too large. Only the first 1000 changed files have been loaded.
Showing with 0 additions and 0 deletions (0 / 0 diffs computed)
swh spinner

Computing file changes ...

back to top

Software Heritage — Copyright (C) 2015–2026, The Software Heritage developers. License: GNU AGPLv3+.
The source code of Software Heritage itself is available on our development forge.
The source code files archived by Software Heritage are available under their own copyright and licenses.
Terms of use: Archive access, API— Content policy— Contact— JavaScript license information— Web API