Pith. sign in

Paper Citation Record · LEDGER

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity

As of 18 August 2026, this Paper Citation Record lists 45 of 45 outbound references and 0 inbound Pith citation observations for arXiv:2511.10414.

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

pith.paper-citation-record.v1
2511.10414 v2

Coverage vector

measured 45 of 45 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-03T22:37:55.138341Z

measured 45 of 45 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-18T06:34:40.430872+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

45 of 45 outbound references displayed

  • verified exact1
  • verified fuzzy0
  • unresolved44
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation d4c59512-82d0-49bc-8e72-78c41eee37bb · outbound

This paper cites SIAM Journal on Optimization16(2), 531–547 (2005).

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity SIAM Journal on Optimization16(2), 531–547 (2005)

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:54.967042Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:54.967042Z digest=sha256:f6166e09c040e01bf2ffc62d3360e3dd51ebc81056b439b5450562191d125878

Observation b041f2d5-611e-4cc9-a590-17eecbece195 · outbound

This paper cites Journal of Machine Learning Research22(98), 1–76 (2021).

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity Journal of Machine Learning Research22(98), 1–76 (2021)

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:54.971661Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:54.971661Z digest=sha256:78c502a12a58793cdfe330f1c1f86b05bee1a7cb4e4f095a391a0a5042fb9e55

Observation 5277eabe-a374-4d6d-8551-e0d4e0cd3c2d · outbound

This paper cites Mathematical Methods of Operations Research89(3), 319–353 (2019).

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity Mathematical Methods of Operations Research89(3), 319–353 (2019)

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:54.975516Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:54.975516Z digest=sha256:7a0163760db644643c5e519f0af90be83b335feab2b54cd1050e1f97b5584f3a

Observation cb583b60-f08a-4d45-9775-5a418fa4788d · outbound

This paper cites SIAM Journal on Optimization31(1), 653–685 (2021).

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity SIAM Journal on Optimization31(1), 653–685 (2021)

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:54.979500Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:54.979500Z digest=sha256:a9fa35ee782c20c318f2d6003440fa1c2dbcc3b35ede4cce740a9674b4d3e875

Observation 6c1ea93a-0e71-46c7-82ec-cde20c45aefe · outbound

This paper cites In: International conference on machine learning, pp.

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity In: International conference on machine learning, pp

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:54.983619Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:54.983619Z digest=sha256:d81bc4b8a72adf8824ffa4cf2e94d8fd6ba0ed50b90c1574b6341a80db0c1b5c

Observation 43e64e9d-9009-402b-b52d-818711b2b98a · outbound

This paper cites Journal of Global Optimization84(3), 563–589 (2022).

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity Journal of Global Optimization84(3), 563–589 (2022)

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:54.987719Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:54.987719Z digest=sha256:888dc67e243d6a00b17b954d125fd422c184c737a23a13b80da1b848d0de15ba

Observation 4db018ed-9918-464e-9635-b598b10e7e9c · outbound

This paper cites Mathematical programming169, 95–118 (2018).

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity Mathematical programming169, 95–118 (2018)

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:54.991989Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:54.991989Z digest=sha256:5e67ee1dba0f5b3ca942caaed2b48faadbbfbcd25fa0b54e643e94ed71048996

Observation 69c9c2b8-155e-4c94-8200-6abcd29142a1 · outbound

This paper cites Mathematics of Operations Research35(2), 438–457 (2010).

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity Mathematics of Operations Research35(2), 438–457 (2010)

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:54.995587Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:54.995587Z digest=sha256:c1f367df09558e09e61c492517328b9c8ecbf7c55a5ef82864307f06c7be2744

Observation 8b3efd7e-9111-4ad8-af26-9fc68957009e · outbound

This paper cites Mathematical Programming137(1), 91–129 (2013).

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity Mathematical Programming137(1), 91–129 (2013)

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:54.999583Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:54.999583Z digest=sha256:88e828da21ae43b4d47853485bd2516bbe337756ec169c554c5b28c2185f9133

Observation ac08978a-ca8e-441f-bec3-6ffa05e6eefc · outbound

This paper cites CMS Books in Mathematics.

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity CMS Books in Mathematics

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.003774Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.003774Z digest=sha256:193e8bc5b50d13120fcd7a462e2eb9919c79d45ab004c9a1c236a03be3966975

Observation 819639dc-6307-48ea-a76b-1e404b3405fa · outbound

This paper cites Journal of Optimization Theory and Applications207(3), 41 (2025).

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity Journal of Optimization Theory and Applications207(3), 41 (2025)

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.007560Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.007560Z digest=sha256:f6629dc143e839cef99651d52218896c9f99246ba7a5c64b68167ac41c140bcf

Observation b110b468-4147-4bee-a21a-032d5adb7470 · outbound

This paper cites Journal of mathematical analysis and applications321(2), 729–740 (2006).

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity Journal of mathematical analysis and applications321(2), 729–740 (2006)

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.011299Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.011299Z digest=sha256:2fd8601371399c9f258fe23214f22857d2f9558cc4bbf266b19ea159ef60d215

Observation 5af4bb34-478c-40df-9445-5fa17526c231 · outbound

This paper cites SIAM Journal on Optimization17(4), 1205–1223 (2007).

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity SIAM Journal on Optimization17(4), 1205–1223 (2007)

Reference 13

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.015448Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.015448Z digest=sha256:cbe65693d08c0c8420bd256b6fbb46a9b5abf88cef5da1ea0418beb121a14ed6

Observation 4feaae16-2953-479a-923d-49be874e3336 · outbound

This paper cites SIAM Journal on Optimization 18(2), 556–572 (2007).

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity SIAM Journal on Optimization 18(2), 556–572 (2007)

Reference 14

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.019275Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.019275Z digest=sha256:aeba8fe92fcf6af33ccdbf0aeb107880f6d59c2d5a156682330fa2b9ccce3cba

Observation e83113dd-5341-4e85-8ecf-22b6e72b4667 · outbound

This paper cites Mathematical Programming165(2), 471–507 (2017).

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity Mathematical Programming165(2), 471–507 (2017)

Reference 15

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.023046Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.023046Z digest=sha256:711f1f4e75af2afbed4dcbc02a026e2babf37439c5cdeae1649b18fc0edb6405

Observation 0d6372a9-4da8-4c5b-ba40-7cb8b1669129 · outbound

This paper cites LQR through the Lens of First Order Methods: Discrete-time Case.

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity LQR through the Lens of First Order Methods: Discrete-time Case

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.026916Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.026916Z digest=sha256:dad5554d0c120c9a01a82e81c69031f6a036e563853c6c75277fd2be8e35898d

Observation c6848972-b1fe-4cbb-a47c-a7c6616d45bd · outbound

This paper cites Advances in Neural Information Processing Systems35, 15836–15848 (2022).

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity Advances in Neural Information Processing Systems35, 15836–15848 (2022)

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.030973Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.030973Z digest=sha256:3f456bf4fbd766785c8f8fccde73e1363bba43b6ce9c55655ab4644e9717f6b0

Observation 6c3f1df8-a7c9-44c4-b9e1-5f0219da7dda · outbound

This paper cites SIAM Journal on Control and Optimization 59(5), 3887–3911 (2021).

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity SIAM Journal on Control and Optimization 59(5), 3887–3911 (2021)

Reference 18

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.034939Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.034939Z digest=sha256:5119e305d8daf4ea117fadd62bdccab75822b1c074b638cc175fe52b86b2fd8d

Observation 859e2f37-4ee2-4bcc-95dc-bf8362e2dc47 · outbound

This paper cites Journal of Optimization Theory and Applications165, 874–900 (2015).

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity Journal of Optimization Theory and Applications165, 874–900 (2015)

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.038828Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.038828Z digest=sha256:43a9440ac99e8d9326bfd6b80125f7092db02b3847396b3dc8b0139e453b4808

Observation 0ccc91a1-d546-4781-87af-83b9e22d858f · outbound

This paper cites Mathematical Programming198(1), 937–996 (2023).

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity Mathematical Programming198(1), 937–996 (2023)

Reference 20

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.042622Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.042622Z digest=sha256:5c5071847e6ac5f9d6b8d3d697e1d289f9296297a16ad6f6f4f489db53c86c32

Observation ed7d52af-1e50-4a5d-8021-d50cb580d511 · outbound

This paper cites ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope.

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope

Reference 21

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.046638Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.046638Z digest=sha256:8b660508c09949896c8eba61fc986da99454dfc877a19fb2c7a8d44916ce747a

Observation 4d404edd-4a0b-493e-960a-71b2db5d2934 · outbound

This paper cites ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization.

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization

Reference 22

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.050610Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.050610Z digest=sha256:0d4b8897d85a7a9c449c7bcc45d9f835832b565baa337a450122e23245ee6b40

Observation 028ee87a-6343-4c44-a0ec-d4f1df23d704 · outbound

This paper cites arXiv (2025).

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity arXiv (2025)

Reference 23

Resolution
verified exact
arxiv_id, observed 2026-08-03T22:38:38.212844Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-03T22:37:55.054573Z digest=sha256:efb0f972a95e6f5d158f8a418b0c10e90b420edf3e0dbedb12c254dfc23ad7bb

Observation 495a6f00-74b4-4b66-bbd2-8b3b475c4a9d · outbound

This paper cites In: Joint European conference on machine learning and knowledge discovery in databases, pp.

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity In: Joint European conference on machine learning and knowledge discovery in databases, pp

Reference 24

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.058288Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.058288Z digest=sha256:ebb855b5464d90ddea184fbd185debdeaa1db3d58a6c9d6286e2dd652a76ebb4

Observation 3be2db76-0d3b-4db4-91fb-1b7420de1407 · outbound

This paper cites Annales de l’institut Fourier48(3), 769–783 (1998) Minimizing smooth Kurdyka- Lojasiewicz functions via generalized descent methods: Convergence rate and complexity 21.

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity Annales de l’institut Fourier48(3), 769–783 (1998) Minimizing smooth Kurdyka- Lojasiewicz functions via generalized descent methods: Convergence rate and complexity 21

Reference 25

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.062330Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.062330Z digest=sha256:75c5d651fd32668a6d690aaaf1ac58906b735aca34f92e89e60fc5a954d8ea50

Observation 247f60ed-4dc2-4d0c-8616-2820dc3ef591 · outbound

This paper cites Foundations of computational mathematics18(5), 1199–1232 (2018).

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity Foundations of computational mathematics18(5), 1199–1232 (2018)

Reference 26

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.066123Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.066123Z digest=sha256:9557bd127cbae8a9afecaffde20051e501d58d87ab0cd55b8babadaae235b923

Observation 9520f0c0-0d05-49d0-92c9-980e069ff450 · outbound

This paper cites Les ´ equations aux d´ eriv´ ees partielles pp.

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity Les ´ equations aux d´ eriv´ ees partielles pp

Reference 27

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.069901Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.069901Z digest=sha256:71a1e2ada2b055f4117c29a974f74d90c8358142d5bdbd9df92d1a0fc30a55ea

Observation 0ceddedd-5d26-47ee-82e8-bfb3b80ca463 · outbound

This paper cites Annales de l’institut Fourier43(5), 1575–1595 (1993).

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity Annales de l’institut Fourier43(5), 1575–1595 (1993)

Reference 28

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.073549Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.073549Z digest=sha256:2313ce3ffe7535dac88fbcc20e699d31eb7a82029eda75f22df40374a6703d62

Observation 6d5d7d07-e0c5-46bc-b2db-4278c21088e7 · outbound

This paper cites In: International conference on machine learning, pp.

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity In: International conference on machine learning, pp

Reference 29

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.077376Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.077376Z digest=sha256:9fd95a0c45a61ea99071eb936decb741999df1687d8eb505e891c04b56be620a

Observation 61348107-6e00-4a4f-a454-e722fdbb0e8d · outbound

This paper cites Springer Cham (2018).

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity Springer Cham (2018)

Reference 30

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.081334Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.081334Z digest=sha256:5bb18402e3bbf2905c1cccc82504ef25c674221c5581374156adc908051fa6ce

Observation 9254126c-6845-4779-bd92-37c686b64279 · outbound

This paper cites Bulletin de la Soci´ et´ e Math´ ematique de France93, 273–299 (1965).

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity Bulletin de la Soci´ et´ e Math´ ematique de France93, 273–299 (1965)

Reference 31

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.085020Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.085020Z digest=sha256:fac3b95cbe96a4a9b8ead3dcd5acdb3cb9ecea4dc35d7fa0fc26e0d8a90e60f1

Observation 68c8948c-188e-4571-922d-25a7c52ca036 · outbound

This paper cites Mathematical Programming152(1-2), 381–404 (2015).

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity Mathematical Programming152(1-2), 381–404 (2015)

Reference 32

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.088624Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.088624Z digest=sha256:9d8ec25a2b18c7ed2e20682f688897b0148ee87993af756389d68895fa4918ff

Observation dee1b2c7-084f-4343-b614-8e896b9064a6 · outbound

This paper cites an unresolved cited work.

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity Unresolved cited work

Reference 33

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.092197Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.092197Z digest=sha256:2e4b5aef6f475075d188735440a7c545adcded376732a4c57952f4ea81fe9eb8

Observation 446ca6f2-481a-4c33-8bc5-5ba8d06485b8 · outbound

This paper cites Springer Science & Business Media (2006).

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity Springer Science & Business Media (2006)

Reference 34

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.096171Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.096171Z digest=sha256:24ee0a86ac2c65a68e6f4d9d87c7120f578349cfb75984f49204113afcbe2c04

Observation 73bb8b84-b27e-4c6a-9f90-16101f26cf99 · outbound

This paper cites Cybernetics9, 145–150 (1973).

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity Cybernetics9, 145–150 (1973)

Reference 35

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.099870Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.099870Z digest=sha256:b7fb9eb15b2e9e9c28c9b7ec7a4291605d30630da8d5d6bb015d13082af4b99c

Observation 920dd9c7-50c0-445f-a749-b9e9ce6b3c17 · outbound

This paper cites Transactions of the American Mathematical Society348(5), 1805–1838 (1996).

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity Transactions of the American Mathematical Society348(5), 1805–1838 (1996)

Reference 36

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.103705Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.103705Z digest=sha256:ccbc84bf617e7b039046cb0143b202e0810caa402018b940f51070857b4b6a82

Observation 6d8c4f5c-3324-46df-b5c7-ba98441613aa · outbound

This paper cites an unresolved cited work.

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity Unresolved cited work

Reference 37

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.107585Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.107585Z digest=sha256:a988e07200869219b005941335efc70ffae72df54299a66f40efa7cc9cd62d31

Observation 8ae50d0f-f25f-4807-b02e-a89502eca6f7 · outbound

This paper cites Journal of Optimization Theory and Applications185, 303–326 (2020).

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity Journal of Optimization Theory and Applications185, 303–326 (2020)

Reference 38

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.111207Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.111207Z digest=sha256:6c70b4af15b373511eb39b2d2e016865ae44789b23e7f8a59e02ccb6cf6560c4

Observation d2cd6353-7af9-47cf-ae26-4cdd0e0e6fb3 · outbound

This paper cites Com- putational Optimization and Applications67(3), 443–487 (2017).

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity Com- putational Optimization and Applications67(3), 443–487 (2017)

Reference 39

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.114890Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.114890Z digest=sha256:3adcf769b540fed611a2c49aeeab0980bb67b0df909275113de4b4c8d2087906

Observation d358ff18-e405-483f-b8af-21673c44951a · outbound

This paper cites an unresolved cited work.

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity Unresolved cited work

Reference 40

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.118817Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.118817Z digest=sha256:af735e82282b4a5471f51d9f2bfc97756be22451c471e65eb4fa205596f41924

Observation c270bb37-d098-4929-9cc5-42a9f142369f · outbound

This paper cites SIAM Journal on Optimization28(3), 2274–2303 (2018).

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity SIAM Journal on Optimization28(3), 2274–2303 (2018)

Reference 41

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.122652Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.122652Z digest=sha256:62dcc3436b01b40e0e203a9e2440b3a90b78dff02c8e1d0c6d746957981b5345

Observation fd787ef3-fe97-4b7c-b75a-1a6986e67511 · outbound

This paper cites Optimization letters10, 1361–1370 (2016).

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity Optimization letters10, 1361–1370 (2016)

Reference 42

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.126434Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.126434Z digest=sha256:8e916bb3d61b78192e8be1c4dd806e49f4f6e5772290cdf114d5e4a5aee804aa

Observation ce2d1a27-5cf8-4745-bc15-52d3b400731d · outbound

This paper cites Foundations of Computational Mathematics 22(4), 1171–1217 (2022).

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity Foundations of Computational Mathematics 22(4), 1171–1217 (2022)

Reference 43

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.130324Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.130324Z digest=sha256:10c176a0c68886226c0bb7ae2741e15cbcc826e4d581a93fb30df34fdf9baee8

Observation 62de023f-91bb-4d9f-b1ee-b61f7bf04ae2 · outbound

This paper cites In: International Conference on Artificial Intelligence and Statistics, pp.

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity In: International Conference on Artificial Intelligence and Statistics, pp

Reference 44

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.134167Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.134167Z digest=sha256:a28b4d57cb2f7788a375d24f7b053297f679ee184e8bc0009220b8d812f90a82

Observation 143b3453-a18a-4ee9-89ab-f8e35a8a93f3 · outbound

This paper cites Global Convergence of Block Coordinate Descent in Deep Learning.

Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity Global Convergence of Block Coordinate Descent in Deep Learning

Reference 45

Resolution
unresolved
no resolver link, observed 2026-08-03T22:37:55.138341Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T22:37:55.138341Z digest=sha256:003be2192f450eac7d42a39fbba844537f991ac8462e4433098b2e5edac01c3e

Pith citing papers

No inbound Pith citation observations are available.