arXiv (OAI Expanded)
open access
A proximal linearized NEP method for composite optimization with conic and manifold constraints
This paper studies DC composite optimization problems with simultaneous conic and manifold constraints. We propose an inexact proximal linearized exact penalty algorithm based on a distance-based penalty function for the conic constraint. The algorithm successively computes approximate minimizers of
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
- Preconditioned Three-Term Conjugate Gradient Framework for Nonconvex Finite Minimax Problems#1083257
- Gradient-Enhanced Proximal Algorithms for Mean Field Planning on Surfaces#997259
- Efficient Mathematical Programming Formulation and Algorithmic Framework for Optimal Camera Placement#1063732
- KT-EGO: A Knowledge Transfer Assisted Efficient Global Optimization Algorithm for Solving High-Dimensional Expensive Black-Box Problems#1141795
- Task-Dependent Difficulty with Negative Slope in Linear Functions#663270
Record · ID 1084509
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