<?xml version="1.0" encoding="utf-8" ?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:r="https://r-universe.dev"><channel><title>econcz.r-universe.dev</title><link>https://econcz.r-universe.dev</link><description>Recent package updates in econcz</description><generator>R-universe</generator><image><url>https://github.com/econcz.png</url><title>R packages by econcz</title><link>https://econcz.r-universe.dev</link></image><lastBuildDate>Sun, 07 Jun 2026 22:32:58 GMT</lastBuildDate><item><title>[econcz] rtmpinv 2.0.0</title><author>ilya.bolotov@vse.cz (Ilya Bolotov)</author><description>The Tabular Matrix Problems via Pseudoinverse Estimation
(TMPinv) is a two-stage estimation method that reformulates
structured table-based systems - such as allocation problems,
transaction matrices, and input-output tables - as structured
least-squares problems. Based on the Convex Least Squares
Programming (CLSP) framework, TMPinv solves systems with row
and column constraints, block structure, and optionally reduced
dimensionality by (1) constructing a canonical constraint form
and applying a pseudoinverse-based projection, followed by (2)
a convex-programming refinement stage to improve fit,
coherence, and regularization (e.g., via Lasso, Ridge, or
Elastic Net).</description><link>https://github.com/r-universe/econcz/actions/runs/27107570234</link><pubDate>Sun, 07 Jun 2026 22:32:58 GMT</pubDate><r:package>rtmpinv</r:package><r:version>2.0.0</r:version><r:status>success</r:status><r:repository>https://econcz.r-universe.dev</r:repository><r:upstream>https://github.com/econcz/rtmpinv</r:upstream></item><item><title>[econcz] rtmpinvi 2.0.0</title><author>ilya.bolotov@vse.cz (Ilya Bolotov)</author><description>Provides an interactive wrapper for the 'tmpinv()'
function from the 'rtmpinv' package with options extending its
functionality to pre- and post-estimation processing and
streamlined incorporation of prior cell information. The
Tabular Matrix Problems via Pseudoinverse Estimation (TMPinv)
is a two-stage estimation method that reformulates structured
table-based systems - such as allocation problems, transaction
matrices, and input-output tables - as structured least-squares
problems. Based on the Convex Least Squares Programming (CLSP)
framework, TMPinv solves systems with row and column
constraints, block structure, and optionally reduced
dimensionality by (1) constructing a canonical constraint form
and applying a pseudoinverse-based projection, followed by (2)
a convex-programming refinement stage to improve fit,
coherence, and regularization (e.g., via Lasso, Ridge, or
Elastic Net).</description><link>https://github.com/r-universe/econcz/actions/runs/27107422964</link><pubDate>Sun, 07 Jun 2026 22:30:51 GMT</pubDate><r:package>rtmpinvi</r:package><r:version>2.0.0</r:version><r:status>success</r:status><r:repository>https://econcz.r-universe.dev</r:repository><r:upstream>https://github.com/econcz/rtmpinvi</r:upstream></item><item><title>[econcz] rlppinv 2.0.0</title><author>ilya.bolotov@vse.cz (Ilya Bolotov)</author><description>The Linear Programming via Regularized Least Squares
(LPPinv) is a two-stage estimation method that reformulates
linear programs as structured least-squares problems. Based on
the Convex Least Squares Programming (CLSP) framework, LPPinv
solves linear inequality, equality, and bound constraints by
(1) constructing a canonical constraint system and computing a
pseudoinverse projection, followed by (2) a convex-programming
correction stage to refine the solution under additional
regularization (e.g., Lasso, Ridge, or Elastic Net). LPPinv is
intended for underdetermined and ill-posed linear problems, for
which standard solvers fail.</description><link>https://github.com/r-universe/econcz/actions/runs/27107569714</link><pubDate>Sun, 07 Jun 2026 22:13:37 GMT</pubDate><r:package>rlppinv</r:package><r:version>2.0.0</r:version><r:status>success</r:status><r:repository>https://econcz.r-universe.dev</r:repository><r:upstream>https://github.com/econcz/rlppinv</r:upstream></item><item><title>[econcz] rclsp 2.0.0</title><author>ilya.bolotov@vse.cz (Ilya Bolotov)</author><description>Convex Least Squares Programming (CLSP) is a two-step
estimator for solving underdetermined, ill-posed, or
structurally constrained least-squares problems. It combines
pseudoinverse-based estimation with convex-programming
correction methods inspired by Lasso, Ridge, and Elastic Net to
ensure numerical stability, constraint enforcement, and
interpretability. The package also provides numerical stability
analysis and CLSP-specific diagnostics, including partial R^2,
normalized RMSE (NRMSE), Monte Carlo t-tests for mean NRMSE,
and condition-number-based confidence bands.</description><link>https://github.com/r-universe/econcz/actions/runs/27107420149</link><pubDate>Sun, 07 Jun 2026 21:35:59 GMT</pubDate><r:package>rclsp</r:package><r:version>2.0.0</r:version><r:status>success</r:status><r:repository>https://econcz.r-universe.dev</r:repository><r:upstream>https://github.com/econcz/rclsp</r:upstream></item><item><title>[econcz] rconvertu 1.1.0</title><author>ilya.bolotov@vse.cz (Ilya Bolotov)</author><description>Convert text into target classifications (e.g., ISO
3166-1) using a JSON mapping with regular expressions. Provides
helpers to return the full mapping and associated metadata.</description><link>https://github.com/r-universe/econcz/actions/runs/27102770560</link><pubDate>Sun, 07 Jun 2026 19:21:23 GMT</pubDate><r:package>rconvertu</r:package><r:version>1.1.0</r:version><r:status>success</r:status><r:repository>https://econcz.r-universe.dev</r:repository><r:upstream>https://github.com/econcz/rconvertu</r:upstream></item></channel></rss>