arXiv (All)
open access
Optimality conditions with cone-generalized convex vector functions
The object of investigation in this paper are generalized convex vector nonlinear programming problems with cone constraints. We prove that a quasiconvex vector function is pseudoconvex with respect to the same cone if and only if every vector critical point of the function is a weak global minimize
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
- Norm-Cone Conjugation for Nonconvex Optimization: Scalar Duality and Exact Distance Penalization#1109103
- The Projected Hessian Quantification Theorem: Exact Duality For Constrained Eigenvalues#1012718
- Geometric Certificates for Deterministic Global Linear Convergence of Overparameterized Projected Gradient Descent#1344412
- Dual characterizations of norm minimization problems#998079
- Robust Error Bounds for Vector-Valued Kernel Ridge Regression#1014037
Record · ID 1343353
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