pith. sign in
Pith Number

pith:XG335CY3

pith:2026:XG335CY33URKBASZDSLE54UYNW
not attested not anchored not stored refs resolved

Asymptotic KKT Conditions for Continuous-Time Nonlinear Programming

Mois\'es R. C. do Monte, Rodrigo B. Moreira, Valeriano A. de Oliveira

Continuous-time nonlinear programs have asymptotic KKT conditions satisfied along a convergent sequence of approximate solutions.

arxiv:2605.12751 v1 · 2026-05-12 · math.OC

Add to your LaTeX paper
\usepackage{pith}
\pithnumber{XG335CY33URKBASZDSLE54UYNW}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp
2 Internet Archive
3 Author claim open · sign in to claim
4 Citations open
5 Replications open
Portable graph bundle live · download bundle · merged state
The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

A sequence of solutions converging to the optimal solution exists such that Karush-Kuhn-Tucker-type conditions are satisfied asymptotically; these conditions are also sufficient under convexity assumptions.

C2weakest assumption

The existence of a sequence of approximate solutions that converge to the true optimum while satisfying the asymptotic KKT conditions (implicit in the necessary-conditions claim and not derived from first principles in the abstract).

C3one line summary

The work establishes asymptotic KKT-type necessary optimality conditions for continuous-time nonlinear programming and shows sufficiency under convexity, while proposing a convergent augmented Lagrangian solver.

References

40 extracted · 40 resolved · 0 Pith anchors

[1] R. Andreani, N. S. Fazzio, M. L. Schuverdt, and L. D. Secchin. A sequen- tial optimality condition related to the quasi-normality constraint qualifi- cation and its algorithmic consequences.SIAM Journ 2019
[2] R. Andreani, W. G´ omez, G. Haeser, L. M. Mito, and A. Ramos. On optimality conditions for nonlinear conic programming.Mathematics of Operations Research, 47(3):2160–2185, 2022 2022
[3] R. Andreani, P.S. Gon¸ calves, and G. N. Silva. Discrete approximations for strict convex continuous time problems and duality.Comp. Appl. Math., 23:81–105, 2004 2004
[4] R. Andreani, G. Haeser, and J. M. Mart´ ınez. On sequential optimality conditions for smooth constrained optimization.Optimization, 60(5):627– 641, 2011 2011
[5] R. Andreani, G. Haeser, A. Ramos, and P. J. S. Silva. A second-order se- quential optimality condition associated to the convergence of optimization algorithms.IMA Journal of Numerical Analysis, 37(4) 1902

Formal links

1 machine-checked theorem link

Receipt and verification
First computed 2026-05-18T03:09:48.768250Z
Builder pith-number-builder-2026-05-17-v1
Signature Pith Ed25519 (pith-v1-2026-05) · public key
Schema pith-number/v1.0

Canonical hash

b9b7be8b1bdd22a082591c964ef2986d8301c63fdba000c34d3fdf346ac36fa2

Aliases

arxiv: 2605.12751 · arxiv_version: 2605.12751v1 · doi: 10.48550/arxiv.2605.12751 · pith_short_12: XG335CY33URK · pith_short_16: XG335CY33URKBASZ · pith_short_8: XG335CY3
Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/XG335CY33URKBASZDSLE54UYNW \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: b9b7be8b1bdd22a082591c964ef2986d8301c63fdba000c34d3fdf346ac36fa2
Canonical record JSON
{
  "metadata": {
    "abstract_canon_sha256": "cfe3e59c867b60ed04ef18da09ea2e8f51549ef35427e0d578273f3493067cfb",
    "cross_cats_sorted": [],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "math.OC",
    "submitted_at": "2026-05-12T21:02:06Z",
    "title_canon_sha256": "4c19be5e6a478c1626111b1bc12dc2e8004c099131408827f70c789d9660a71e"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.12751",
    "kind": "arxiv",
    "version": 1
  }
}