arXiv (All)
open access
A projected descent method for minimization of weakly semismooth functions over polyhedral sets
This study develops a projection-based descent method for minimizing weakly semismooth functions over polyhedral sets, taking an initial step toward extending projection-based descent algorithms to nonsmooth, nonconvex optimization problems. At each iteration, the method considers an inner approxima
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
- Regularized coordinate minimization for nonconvex composite optimization with application to quantized image compression#973853
- On the Absence of Identifiable Manifolds in Finite-Max Composite Optimization#625247
- On the Absence of Identifiable Manifolds in Finite-Max Composite Optimization#622974
- An Adaptive Computational Framework for Structural Shape Optimization: Deterministic and Robust Formulations#1040206
- Regularized Extragradient Methods for Solving Equilibrium Problems on Hadamard Manifolds#793453
Record · ID 1131124
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