REVIEW 1 cited by
SDLS: a Matlab package for solving conic least-squares problems
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
SDLS: a Matlab package for solving conic least-squares problems
read the original abstract
This document is an introduction to the Matlab package SDLS (Semi-Definite Least-Squares) for solving least-squares problems over convex symmetric cones. The package is shortly presented through the addressed problem, a sketch of the implemented algorithm, the syntax and calling sequences, a simple numerical example and some more advanced features. The implemented method consists in solving the dual problem with a quasi-Newton algorithm. We note that SDLS is not the most competitive implementation of this algorithm: efficient, robust, commercial implementations are available (contact the authors). Our main goal with this Matlab SDLS package is to provide a simple, user-friendly software for solving and experimenting with semidefinite least-squares problems. Up to our knowledge, no such freeware exists at this date.
Forward citations
Cited by 1 Pith paper
-
Lifting-Free Quadratic Sum-Of-Squares Programming
A penalty-based, lifting-free dual algorithm solves quadratic sum-of-squares programs with accelerated-gradient convergence guarantees and a reported average speed advantage over SCS (NSGM 1.40) on 240 regression benchmarks.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.