sdplab 0.0.1__tar.gz

sdplab-0.0.1/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2026 Pavlo Pelikh
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

sdplab-0.0.1/PKG-INFO

@@ -0,0 +1,167 @@
+Metadata-Version: 2.4
+Name: sdplab
+Version: 0.0.1
+Summary: Tools for constructing and solving regularized semidefinite programming problems.
+Author: Pavlo Pelikh
+License-Expression: Apache-2.0
+Project-URL: Homepage, https://github.com/Pavlo3P/SDPLab
+Project-URL: Repository, https://github.com/Pavlo3P/SDPLab
+Project-URL: Issues, https://github.com/Pavlo3P/SDPLab/issues
+Project-URL: Changelog, https://github.com/Pavlo3P/SDPLab/blob/master/CHANGELOG.md
+Keywords: semidefinite-programming,conic-optimization,convex-optimization,regularization,quantum,jax,numpy
+Classifier: Development Status :: 3 - Alpha
+Classifier: Intended Audience :: Science/Research
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Topic :: Scientific/Engineering :: Mathematics
+Requires-Python: >=3.11
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: numpy
+Requires-Dist: scipy
+Requires-Dist: cvxpy
+Requires-Dist: spacecore<0.5,>=0.4.2
+Provides-Extra: jax
+Requires-Dist: spacecore[jax]; extra == "jax"
+Requires-Dist: jax>=0.9.1; extra == "jax"
+Requires-Dist: optax>=0.2; extra == "jax"
+Provides-Extra: test
+Requires-Dist: pytest>=8.0; extra == "test"
+Dynamic: license-file
+
+# SDPLab
+
+A library for building semidefinite and conic programs and solving them
+through their **smoothed dual**. Problem data, spectral regularizers, and the
+dual functional live here; every first-order optimization loop is delegated to
+[spacecore](https://pypi.org/project/spacecore/).
+
+## Install
+
+```bash
+pip install sdplab
+```
+
+The JAX backend and the optax optimizer are optional:
+
+```bash
+pip install "sdplab[jax]"
+```
+
+## The problem
+
+$$
+\begin{aligned}
+\min_{X \in \mathrm{dom}(\mathcal{A})}\quad
+    & \langle C, X\rangle \\
+\text{s.t.}\quad
+    & \mathcal{A}X = b, \\
+    & X \succeq 0.
+\end{aligned}
+$$
+
+| symbol | code | meaning |
+| --- | --- | --- |
+| $\mathrm{dom}(\mathcal{A})$ | `problem.dom` | space of $X$ and $C$ |
+| $\mathrm{cod}(\mathcal{A})$ | `problem.cod` | space of $\mathcal{A}X$, $b$, and the dual $y$ |
+| $\mathcal{A}$ | `problem.A` | linear constraint operator, a spacecore `LinOp` |
+| $\mathcal{A}^\dagger y - C$ | `problem.dual_slack(y)` | dual slack |
+
+$X$ is a plain element of a spacecore Euclidean Jordan algebra space — a
+Hermitian matrix (classic SDP), a nonnegative vector (LP), or a tree of such
+blocks — and $X \succeq 0$ means a nonnegative Jordan spectrum. Solvers accept
+and return raw arrays and trees; there are no wrapper objects.
+
+```python
+import numpy as np
+from spacecore import Context, DenseLinOp, DenseVectorSpace, HermitianSpace, NumpyOps
+from sdplab import SDPProblem
+
+ctx = Context(NumpyOps())                   # optional; see the spacecore docs
+dom = HermitianSpace(n, ctx=ctx)            # X and C live here
+cod = DenseVectorSpace((m,), ctx=ctx)       # A X, b, and the dual y live here
+
+A = DenseLinOp(A_mats, dom, cod, ctx=ctx)
+problem = SDPProblem(C, A, b, ctx=ctx)
+```
+
+Solve it directly with the CVXPY reference backend:
+
+```python
+from sdplab.solvers import run_cvxpy_solver
+
+X, y = run_cvxpy_solver(problem, solver="CLARABEL")
+```
+
+## The smoothed dual
+
+Penalize the primal with a superlinear convex $\varphi$ at strength
+$\varepsilon > 0$:
+
+$$
+\min_X\ \langle C, X\rangle + \varepsilon\,\mathrm{Tr}[\varphi(X)]
+\quad\text{s.t.}\quad \mathcal{A}X = b,\ X \succeq 0.
+$$
+
+Its dual is unconstrained and differentiable:
+
+$$
+\max_{y}\ D_\varepsilon(y) = \langle b, y\rangle - \varepsilon\,
+\mathrm{Tr}\!\left[\psi\!\left(\frac{\mathcal{A}^\dagger y - C}{\varepsilon}\right)\right],
+$$
+
+with $\psi$ the Legendre transform of $\varphi$. Gradient methods apply, and the
+primal is read back off the eigenvalues $s_i$ of the dual slack:
+$\lambda_i(X) = \psi'(s_i/\varepsilon)$.
+
+This route **assumes a unit-trace primal** — `primal_from_dual` normalizes to
+$\mathrm{Tr}\,X = 1$ — so pose the problem accordingly, hence `unit_trace=True`
+below. On a problem whose feasible set has a different trace the recovered $X$
+is not feasible for it.
+
+```python
+from sdplab import EntropyReg, RegularizedSDPDualFunctional, run_regularized_solver
+from sdplab.examples import generate_max_cut
+
+problem = generate_max_cut(8, seed=0, unit_trace=True)
+dual = RegularizedSDPDualFunctional(problem, EntropyReg(problem.dom))
+
+result = run_regularized_solver(dual.bind(0.1), verbose=0)
+X = dual.primal_from_dual(result.dual, 0.1)
+
+problem.primal_objective(X)     # -5.0859, against -5.0990 from CVXPY
+```
+
+$\varepsilon$ is a per-call argument, so a continuation schedule can lower it
+without rebuilding anything; `bind(eps)` fixes it and yields a standard
+single-argument `spacecore.Functional`.
+
+The theoretical basis for the regularized SDP formulation — the smoothed dual,
+the primal recovery map, and the $\varepsilon \downarrow 0$ limit — is developed
+in [arXiv:2602.23144](https://arxiv.org/abs/2602.23144).
+
+## Regularizers
+
+| class | $\varphi(t)$ |
+| --- | --- |
+| `EntropyReg` | $t(\log t - 1)$ |
+| `QuadraticReg` | $t^2/2$ |
+
+## Examples
+
+`sdplab.examples` ships three instances, chosen to differ in the structure of
+$\mathcal{A}$:
+
+- `generate_max_cut` — real, diagonal extraction. `unit_trace=True` rescales the
+  variable so $\mathrm{Tr}\,X = 1$.
+- `generate_random_qot` — quantum optimal transport: complex, with a stacked
+  Hermitian-block codomain, so the dual is a tuple of matrices.
+- `generate_qubit_tomography` — zero cost, so pure feasibility.
+
+## Backends
+
+Everything is written against spacecore's backend contract, so NumPy, JAX, and
+torch contexts all work. `run_regularized_solver` picks
+`spacecore.minimize_optax` on a JAX backend and `spacecore.minimize_scipy`
+otherwise. 

sdplab-0.0.1/README.md

@@ -0,0 +1,135 @@
+# SDPLab
+
+A library for building semidefinite and conic programs and solving them
+through their **smoothed dual**. Problem data, spectral regularizers, and the
+dual functional live here; every first-order optimization loop is delegated to
+[spacecore](https://pypi.org/project/spacecore/).
+
+## Install
+
+```bash
+pip install sdplab
+```
+
+The JAX backend and the optax optimizer are optional:
+
+```bash
+pip install "sdplab[jax]"
+```
+
+## The problem
+
+$$
+\begin{aligned}
+\min_{X \in \mathrm{dom}(\mathcal{A})}\quad
+    & \langle C, X\rangle \\
+\text{s.t.}\quad
+    & \mathcal{A}X = b, \\
+    & X \succeq 0.
+\end{aligned}
+$$
+
+| symbol | code | meaning |
+| --- | --- | --- |
+| $\mathrm{dom}(\mathcal{A})$ | `problem.dom` | space of $X$ and $C$ |
+| $\mathrm{cod}(\mathcal{A})$ | `problem.cod` | space of $\mathcal{A}X$, $b$, and the dual $y$ |
+| $\mathcal{A}$ | `problem.A` | linear constraint operator, a spacecore `LinOp` |
+| $\mathcal{A}^\dagger y - C$ | `problem.dual_slack(y)` | dual slack |
+
+$X$ is a plain element of a spacecore Euclidean Jordan algebra space — a
+Hermitian matrix (classic SDP), a nonnegative vector (LP), or a tree of such
+blocks — and $X \succeq 0$ means a nonnegative Jordan spectrum. Solvers accept
+and return raw arrays and trees; there are no wrapper objects.
+
+```python
+import numpy as np
+from spacecore import Context, DenseLinOp, DenseVectorSpace, HermitianSpace, NumpyOps
+from sdplab import SDPProblem
+
+ctx = Context(NumpyOps())                   # optional; see the spacecore docs
+dom = HermitianSpace(n, ctx=ctx)            # X and C live here
+cod = DenseVectorSpace((m,), ctx=ctx)       # A X, b, and the dual y live here
+
+A = DenseLinOp(A_mats, dom, cod, ctx=ctx)
+problem = SDPProblem(C, A, b, ctx=ctx)
+```
+
+Solve it directly with the CVXPY reference backend:
+
+```python
+from sdplab.solvers import run_cvxpy_solver
+
+X, y = run_cvxpy_solver(problem, solver="CLARABEL")
+```
+
+## The smoothed dual
+
+Penalize the primal with a superlinear convex $\varphi$ at strength
+$\varepsilon > 0$:
+
+$$
+\min_X\ \langle C, X\rangle + \varepsilon\,\mathrm{Tr}[\varphi(X)]
+\quad\text{s.t.}\quad \mathcal{A}X = b,\ X \succeq 0.
+$$
+
+Its dual is unconstrained and differentiable:
+
+$$
+\max_{y}\ D_\varepsilon(y) = \langle b, y\rangle - \varepsilon\,
+\mathrm{Tr}\!\left[\psi\!\left(\frac{\mathcal{A}^\dagger y - C}{\varepsilon}\right)\right],
+$$
+
+with $\psi$ the Legendre transform of $\varphi$. Gradient methods apply, and the
+primal is read back off the eigenvalues $s_i$ of the dual slack:
+$\lambda_i(X) = \psi'(s_i/\varepsilon)$.
+
+This route **assumes a unit-trace primal** — `primal_from_dual` normalizes to
+$\mathrm{Tr}\,X = 1$ — so pose the problem accordingly, hence `unit_trace=True`
+below. On a problem whose feasible set has a different trace the recovered $X$
+is not feasible for it.
+
+```python
+from sdplab import EntropyReg, RegularizedSDPDualFunctional, run_regularized_solver
+from sdplab.examples import generate_max_cut
+
+problem = generate_max_cut(8, seed=0, unit_trace=True)
+dual = RegularizedSDPDualFunctional(problem, EntropyReg(problem.dom))
+
+result = run_regularized_solver(dual.bind(0.1), verbose=0)
+X = dual.primal_from_dual(result.dual, 0.1)
+
+problem.primal_objective(X)     # -5.0859, against -5.0990 from CVXPY
+```
+
+$\varepsilon$ is a per-call argument, so a continuation schedule can lower it
+without rebuilding anything; `bind(eps)` fixes it and yields a standard
+single-argument `spacecore.Functional`.
+
+The theoretical basis for the regularized SDP formulation — the smoothed dual,
+the primal recovery map, and the $\varepsilon \downarrow 0$ limit — is developed
+in [arXiv:2602.23144](https://arxiv.org/abs/2602.23144).
+
+## Regularizers
+
+| class | $\varphi(t)$ |
+| --- | --- |
+| `EntropyReg` | $t(\log t - 1)$ |
+| `QuadraticReg` | $t^2/2$ |
+
+## Examples
+
+`sdplab.examples` ships three instances, chosen to differ in the structure of
+$\mathcal{A}$:
+
+- `generate_max_cut` — real, diagonal extraction. `unit_trace=True` rescales the
+  variable so $\mathrm{Tr}\,X = 1$.
+- `generate_random_qot` — quantum optimal transport: complex, with a stacked
+  Hermitian-block codomain, so the dual is a tuple of matrices.
+- `generate_qubit_tomography` — zero cost, so pure feasibility.
+
+## Backends
+
+Everything is written against spacecore's backend contract, so NumPy, JAX, and
+torch contexts all work. `run_regularized_solver` picks
+`spacecore.minimize_optax` on a JAX backend and `spacecore.minimize_scipy`
+otherwise. 

sdplab-0.0.1/pyproject.toml

@@ -0,0 +1,65 @@
+[build-system]
+requires = ["setuptools>=69", "wheel"]
+build-backend = "setuptools.build_meta"
+
+[project]
+name = "sdplab"
+dynamic = ["version"]
+description = "Tools for constructing and solving regularized semidefinite programming problems."
+readme = "README.md"
+requires-python = ">=3.11"
+license = "Apache-2.0"
+license-files = ["LICENSE"]
+authors = [
+  { name = "Pavlo Pelikh" }
+]
+dependencies = [
+    "numpy",
+    "scipy",
+    "cvxpy",
+    "spacecore>=0.4.2,<0.5",
+]
+
+keywords = [
+  "semidefinite-programming",
+  "conic-optimization",
+  "convex-optimization",
+  "regularization",
+  "quantum",
+  "jax",
+  "numpy",
+]
+
+classifiers = [
+  "Development Status :: 3 - Alpha",
+  "Intended Audience :: Science/Research",
+  "Programming Language :: Python :: 3",
+  "Programming Language :: Python :: 3.11",
+  "Programming Language :: Python :: 3.12",
+  "Topic :: Scientific/Engineering :: Mathematics",
+]
+
+[project.optional-dependencies]
+jax = [
+    "spacecore[jax]",
+    "jax>=0.9.1",
+    "optax>=0.2",
+]
+test = [
+    "pytest>=8.0",
+]
+
+[project.urls]
+Homepage = "https://github.com/Pavlo3P/SDPLab"
+Repository = "https://github.com/Pavlo3P/SDPLab"
+Issues = "https://github.com/Pavlo3P/SDPLab/issues"
+Changelog = "https://github.com/Pavlo3P/SDPLab/blob/master/CHANGELOG.md"
+
+[tool.setuptools.dynamic]
+version = { attr = "sdplab._version.__version__" }
+
+[tool.setuptools.packages.find]
+include = ["sdplab*"]
+
+[tool.pytest.ini_options]
+testpaths = ["tests"]

sdplab-0.0.1/sdplab/__init__.py

@@ -0,0 +1,115 @@
+# Copyright 2026 Pavlo Pelikh
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#     http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+
+r"""Semidefinite and conic programs over spacecore Euclidean Jordan algebras.
+
+.. math::
+
+    \min_X \quad \langle C, X\rangle
+    \quad \text{s.t.} \quad \mathcal{A}X = b,\quad X \succeq 0
+
+``X`` is any Jordan-algebra element -- Hermitian matrix, nonnegative vector, or
+a tree of such blocks -- and :math:`X \succeq 0` means a nonnegative spectrum.
+Build with ``SDPProblem(C, A, b)``; solve with :func:`run_cvxpy_solver`, or
+smooth it: a :class:`Regularizer` through
+:class:`RegularizedSDPDualFunctional`, ``.bind(eps)``, then
+:func:`run_regularized_solver`.
+
+Smoothing adds :math:`\varepsilon \operatorname{Tr}[\varphi(X)]` to the primal,
+giving the differentiable dual
+
+.. math::
+
+    D_\varepsilon(y) = \langle b, y\rangle - \varepsilon
+      \operatorname{Tr}\!\big[\psi\big(
+      (\mathcal{A}^\dagger y - C)/\varepsilon\big)\big],
+
+maximized over ``y`` in ``cod``, with :math:`\psi'` of the dual slack
+recovering the primal. :math:`\varepsilon` is per-call, so continuation needs
+no rebuild.
+
+Subpackages: :mod:`~sdplab.problem`, :mod:`~sdplab.regularization`,
+:mod:`~sdplab.solvers`, :mod:`~sdplab.examples`, :mod:`~sdplab.linalg`,
+:mod:`~sdplab.special`.
+"""
+
+from __future__ import annotations
+
+from typing import TYPE_CHECKING
+
+from .problem import (
+    ConstraintOp,
+    Cost,
+    DenseConstraintOp,
+    MatrixFreeConstraintOp,
+    SDPProblem,
+    SparseConstraintOp,
+)
+from .regularization import (
+    BoundDualFunctional,
+    EntropyReg,
+    QuadraticReg,
+    RegularizedSDPDualFunctional,
+    Regularizer,
+)
+from ._version import __version__
+
+# Solvers pull in CVXPY (~1.2s), making an optional backend a hard requirement
+# for anyone who only builds problems. PEP 562 keeps them reachable as
+# ``sdplab.run_*`` while deferring the cost to first use.
+_LAZY = {
+    "run_regularized_solver": "sdplab.solvers",
+    "run_cvxpy_solver": "sdplab.solvers",
+}
+
+if TYPE_CHECKING:  # type checkers and IDEs do not run __getattr__
+    from .solvers import run_cvxpy_solver, run_regularized_solver
+
+
+def __getattr__(name: str):
+    """Resolve the lazily-exported solver entry points on first access."""
+    module = _LAZY.get(name)
+    if module is None:
+        raise AttributeError(f"module {__name__!r} has no attribute {name!r}")
+    import importlib
+
+    value = getattr(importlib.import_module(module), name)
+    globals()[name] = value          # cache, so this runs once per name
+    return value
+
+
+def __dir__() -> list[str]:
+    """Include the lazy names in ``dir(sdplab)`` and tab completion."""
+    return sorted(set(globals()) | set(_LAZY))
+
+
+__all__ = [
+    "__version__",
+    # problem data
+    "SDPProblem",
+    "Cost",
+    "ConstraintOp",
+    "DenseConstraintOp",
+    "SparseConstraintOp",
+    "MatrixFreeConstraintOp",
+    # regularization and the smoothed dual
+    "Regularizer",
+    "EntropyReg",
+    "QuadraticReg",
+    "RegularizedSDPDualFunctional",
+    "BoundDualFunctional",
+    # solvers (lazy)
+    "run_regularized_solver",
+    "run_cvxpy_solver",
+]