Paper Citation Record · LEDGER

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization

As of 17 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2506.08506.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2506.08506 v2

Coverage vector

measured 37 of 37 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T05:26:27.529240Z

measured 37 of 37 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-17T06:30:58.91139+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

37 of 37 outbound references displayed

verified exact4
verified fuzzy24
unresolved8
parse uncertain0
malformed identifier1
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation e16be9d7-10ad-4305-96f1-55ff57811e05 · outbound

This paper cites Achieving zero constraint violation for constrained reinforcement learning via primal-dual approach.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization Achieving zero constraint violation for constrained reinforcement learning via primal-dual approach

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:26:29.077219Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 76de4335-3374-43a5-afd9-c1962909ba78 · outbound

This paper cites an unresolved cited work.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization Unresolved cited work

Reference 2

Resolution: unresolved; raw_fallback, observed 2026-08-07T05:26:29.018017Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 4daac793-f4bf-4a5a-aac2-3fd5c6a263ad · outbound

This paper cites Projected Newton methods for optimization problems with simple con- straints.SIAM Journal on Control and Optimization, 20(2):221–246, 1982.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization Projected Newton methods for optimization problems with simple con- straints.SIAM Journal on Control and Optimization, 20(2):221–246, 1982

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:26:28.976880Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 14750d0b-050d-4567-b0c7-8e951536050f · outbound

This paper cites Nonlinear programming.Journal of the Operational Research Society, 48(3):334–334, 1997.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization Nonlinear programming.Journal of the Operational Research Society, 48(3):334–334, 1997

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:26:28.940808Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation c267ae15-c201-4340-8396-b04967721f7e · outbound

This paper cites Academic press, 2014.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization Academic press, 2014

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:26:28.896695Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 52a1dd1f-230d-4f64-9c74-166ade6eefad · outbound

This paper cites Stochastic first-order methods for convex and nonconvex functional constrained optimization.Mathematical Programming, 197(1):215–279, 2023.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization Stochastic first-order methods for convex and nonconvex functional constrained optimization.Mathematical Programming, 197(1):215–279, 2023

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:26:28.859212Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 91e38455-b649-4ad0-ac69-df9a87a4d929 · outbound

This paper cites Cambridge University Press, 2004.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization Cambridge University Press, 2004

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-07T05:26:27.246856Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9f833ce9-923d-4f4d-b8a0-110468bf1081 · outbound

This paper cites On the field of values of a matrix.Proceedings of the American Mathematical Society, 12:61–66, 1961.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization On the field of values of a matrix.Proceedings of the American Mathematical Society, 12:61–66, 1961

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:26:28.805440Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 9635febb-7395-4ff4-9575-e8548efe4e53 · outbound

This paper cites On the copositive representation of binary and continuous nonconvex quadratic programs.Mathematical Programming, 120(2):479–495, 2009.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization On the copositive representation of binary and continuous nonconvex quadratic programs.Mathematical Programming, 120(2):479–495, 2009

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-07T05:26:27.272205Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f5f7884f-d613-42de-a5ad-182d2998c831 · outbound

This paper cites MOS-SIAM Series on Optimization, 2022.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization MOS-SIAM Series on Optimization, 2022

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:26:28.741363Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 3e50ac05-fb4c-4cd9-b106-f6a00d0055e2 · outbound

This paper cites On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:26:28.709530Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation fece937b-24a4-4508-9dbe-4d4909756d46 · outbound

This paper cites On the complexity of finding first-order critical points in constrained nonlinear optimization.Mathematical Programming, 144(1):93–106, 2014.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization On the complexity of finding first-order critical points in constrained nonlinear optimization.Mathematical Programming, 144(1):93–106, 2014

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:26:28.679578Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 9500f6a9-4a1d-45d7-a4aa-c8bd5db3c8d3 · outbound

This paper cites A near-optimal primal-dual method for off-policy learning in cmdp.Advances in Neural Information Processing Systems, 35:10521–10532, 2022.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization A near-optimal primal-dual method for off-policy learning in cmdp.Advances in Neural Information Processing Systems, 35:10521–10532, 2022

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:26:28.640772Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation d50a27fc-288b-49ba-b04a-cfef982c7cf8 · outbound

This paper cites MOS-SIAM Series on Optimization, 2022.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization MOS-SIAM Series on Optimization, 2022

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:26:28.617826Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation b02229b2-d3cf-4cb7-a798-47557be635c1 · outbound

This paper cites Approximation of the stability number of a graph via copositive programming.SIAM Journal on Optimization, 12(4):875–892, 2002.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization Approximation of the stability number of a graph via copositive programming.SIAM Journal on Optimization, 12(4):875–892, 2002

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:26:28.584538Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 9ae29e84-5acd-4f95-8d2c-0a26d7dfe0e7 · outbound

This paper cites Constrained composite optimization and augmented Lagrangian methods.Mathematical Programming, 201(1):863– 896, 2023.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization Constrained composite optimization and augmented Lagrangian methods.Mathematical Programming, 201(1):863– 896, 2023

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:26:28.544645Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation d6a497f7-5c1a-46f2-9179-d66886608efe · outbound

This paper cites Copositive programming – a survey.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization Copositive programming – a survey

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:26:28.499469Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 9b3144f7-4c47-48fa-8a5a-f79dcd5087df · outbound

This paper cites Barrier Algorithms for Constrained Non-Convex Optimization.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization Barrier Algorithms for Constrained Non-Convex Optimization

Reference 18

Resolution: verified exact; local_arxiv, observed 2026-08-07T05:26:27.969042Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 4aa98d4e-889f-452d-84ee-132af2b6566a · outbound

This paper cites On the complexity of an augmented Lagrangian method for nonconvex optimization.IMA Journal of Numerical Analysis, 41(2):1546–1568, 2021.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization On the complexity of an augmented Lagrangian method for nonconvex optimization.IMA Journal of Numerical Analysis, 41(2):1546–1568, 2021

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-07T05:26:27.358024Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 195f694b-d795-4d41-a3c9-60941af4ffb5 · outbound

This paper cites Safe Zeroth-Order Optimization Using Quadratic Local Approximations.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization Safe Zeroth-Order Optimization Using Quadratic Local Approximations

Reference 20

Resolution: verified exact; local_arxiv, observed 2026-08-07T05:26:27.913323Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 71f08c1c-96f1-43d3-8835-d6e274fdd3ab · outbound

This paper cites Safe zeroth- order convex optimization using quadratic local approximations.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization Safe zeroth- order convex optimization using quadratic local approximations

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:26:28.446698Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation b44a2a54-280d-4ee7-8a9d-f96524f1d646 · outbound

This paper cites Safe Zeroth-Order Optimization Using Linear Programs.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization Safe Zeroth-Order Optimization Using Linear Programs

Reference 22

Resolution: verified exact; local_arxiv, observed 2026-08-07T05:26:27.809350Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 957bc969-b566-4555-9672-3a277b012a87 · outbound

This paper cites an unresolved cited work.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization Unresolved cited work

Reference 23

Resolution: unresolved; raw_fallback, observed 2026-08-07T05:26:28.410210Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation d06c7c10-9aa6-43a6-9e36-65a2df635517 · outbound

This paper cites Rate-improved inex- act augmented Lagrangian method for constrained nonconvex optimization.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization Rate-improved inex- act augmented Lagrangian method for constrained nonconvex optimization

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:26:28.373524Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation afa32485-72cb-4d0f-aa4e-768badfb6850 · outbound

This paper cites Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization.Computational Optimization and Applications, 82(1):175–224, 2022.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization.Computational Optimization and Applications, 82(1):175–224, 2022

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:26:28.332561Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation c03f5237-f489-487a-8fa5-b82f2e8a473a · outbound

This paper cites A level-set method for convex opti- mization with a feasible solution path.SIAM Journal on Optimization, 28:3290–3311, 2018.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization A level-set method for convex opti- mization with a feasible solution path.SIAM Journal on Optimization, 28:3290–3311, 2018

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:26:28.293412Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation ad426628-4ada-44e8-930d-9e3b5847126b · outbound

This paper cites On Brickman’s theorem.Journal of Convex Analysis, 12:139– 143, 2005.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization On Brickman’s theorem.Journal of Convex Analysis, 12:139– 143, 2005

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:26:28.257454Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation ffb45dce-a7c9-4fc1-9238-c55f77ab1c72 · outbound

This paper cites Kluwer Academic Publishers, 2004.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization Kluwer Academic Publishers, 2004

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:26:28.215089Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 5a718a57-c484-4b92-8e61-940ac4a958ad · outbound

This paper cites Springer, 2018.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization Springer, 2018

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-07T05:26:27.452174Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0bb53b02-439d-4e86-9cd6-3c10050ad97f · outbound

This paper cites Springer, 1999.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization Springer, 1999

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:26:28.159270Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation b6065c6d-0491-4779-a276-9d46561ac752 · outbound

This paper cites Convergence to Second-Order Stationarity for Constrained Non-Convex Optimization.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization Convergence to Second-Order Stationarity for Constrained Non-Convex Optimization

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-07T05:26:27.469671Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 00be3379-2e69-41ff-9b53-2b65d0dd56a2 · outbound

This paper cites Constrained non-convex optimization via stochastic variance reduced approximations.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization Constrained non-convex optimization via stochastic variance reduced approximations

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:26:28.119955Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 986225fd-f6be-4631-af01-2ec4ad70c339 · outbound

This paper cites An inexact augmented lagrangian framework for nonconvex optimization with nonlinear constraints.Ad- vances in Neural Information Processing Systems, 32, 2019.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization An inexact augmented lagrangian framework for nonconvex optimization with nonlinear constraints.Ad- vances in Neural Information Processing Systems, 32, 2019

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:26:28.082818Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 3013009b-f1aa-4a3d-9475-552d5eee97a6 · outbound

This paper cites On cones of nonnegative quadratic functions.Mathematics of Operations Research, 28:246–267, 2003.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization On cones of nonnegative quadratic functions.Mathematics of Operations Research, 28:246–267, 2003

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:26:28.050748Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 87b6499e-0757-4cfe-8617-7db3f9c6d450 · outbound

This paper cites Novel Optimization Techniques for Parameter Estimation.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization Novel Optimization Techniques for Parameter Estimation

Reference 35

Resolution: verified exact; local_arxiv, observed 2026-08-07T05:26:27.734650Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 2cc98ee6-5e16-47ed-a332-213106c1e477 · outbound

This paper cites Solving convex smooth function constrained optimization is as almost easy as unconstrained optimization.arXiv preprint arXiv:2210.05807, 2022.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization Solving convex smooth function constrained optimization is as almost easy as unconstrained optimization.arXiv preprint arXiv:2210.05807, 2022

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-07T05:26:27.519072Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 39be0815-ae79-4ecc-9218-d47f16aaad3c · outbound

This paper cites A first-order primal-dual method for nonconvex constrained optimization based on the augmented Lagrangian.Mathematics of Operations Research, 49(1):1–651, 2024.

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization A first-order primal-dual method for nonconvex constrained optimization based on the augmented Lagrangian.Mathematics of Operations Research, 49(1):1–651, 2024

Reference 37

Resolution: malformed identifier; raw_fallback, observed 2026-08-07T05:26:28.010412Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Pith citing papers

No inbound Pith citation observations are available.