arXiv (OAI Expanded)
open access
Nonsmooth Newton methods with effective subspaces for polyhedral regularization
We propose several new nonsmooth Newton methods for solving convex composite optimization problems with polyhedral regularizers, while avoiding the computation of complicated second-order information on these functions. Under the tilt-stability condition at the optimal solution, these methods achiev
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Total Variation Regularization for Manifold-Valued Data#260064
- Ritz method-based elasticity solution of bi-directional functionally graded beams with different material distributions and boundary conditions#264919
- Global Optimality for Constrained Exploration via Penalty Regularization#146917
- Ensuring Monotonic Policy Improvement in Entropy-regularized Value-based Reinforcement Learning#478231
- Trajectory Optimization for Long-range Air-launched Gliding Vehicles using Convex Programming#433624
Record · ID 1070728
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive