{"entities":{"Q6982689":{"pageid":21399165,"ns":120,"title":"Item:Q6982689","lastrevid":76295463,"modified":"2026-04-23T13:50:01Z","type":"item","id":"Q6982689","labels":{"en":{"language":"en","value":"Two-timescale gradient descent ascent algorithms for nonconvex minimax optimization"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8041960"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6982689$718F24F6-5960-442F-9033-8E060C44944D","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"51f709b0751f245e227cce84e9231a212092b2a1","datavalue":{"value":{"text":"Two-timescale gradient descent ascent algorithms for nonconvex minimax optimization","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6982689$A5962DE2-08CF-4224-BE5B-61D9392B4488","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"584077a18d9cce0d78533ebf629d05d83defd7d8","datavalue":{"value":{"entity-type":"item","numeric-id":888300,"id":"Q888300"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6982689$7827BD1A-5ACA-4DC6-988F-ECD303A32A36","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"ef3fd4c98ad338ee8a7ca5df97a4e12e361fc14f","datavalue":{"value":{"entity-type":"item","numeric-id":2097803,"id":"Q2097803"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6982689$3D617515-4379-4D85-90E3-901470517DAA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"6db42b91e9bcee5d1a18d4510f2b904afc4c2779","datavalue":{"value":{"entity-type":"item","numeric-id":251612,"id":"Q251612"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6982689$872AC46A-106C-4E6B-A76D-B810517F6365","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"05810dfd27f2b8a246f7d0a5b34fbcc72e448b7a","datavalue":{"value":{"entity-type":"item","numeric-id":6582882,"id":"Q6582882"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6982689$47F3883D-156A-413D-AFF7-04B00819605E","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"9e38b2634e305e231552e36caaa08079db34ce75","datavalue":{"value":{"time":"+2025-05-16T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6982689$FAD4F41B-74BF-4597-9011-CFE85626D629","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"ae4950e1bb86eb1afedc6358f98593fedb965c97","datavalue":{"value":"https://jmlr.org/papers/v26/22-0863.html","type":"string"},"datatype":"url"},"type":"statement","id":"Q6982689$BD736E6C-3AE3-4792-A13C-7A7B0213EE56","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"80ee1f136aa51caf69f5e21f1a393a3bb7b0c14c","datavalue":{"value":"The authors introduce and investigate two-timescale gradient descent ascent type algorithms for solving structured minimax problems, where nonconvexity in the first variable and concavity in the second variable are imposed (the underlying set is convex and bounded). Theoretical bounds on the complexity for solving smooth and nonsmooth problems are derived as well.","type":"string"},"datatype":"string"},"type":"statement","id":"Q6982689$CAF94150-BDDA-4738-A944-89F3C9524161","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"81da91301ac457b570af6e36c49113e88792bb0e","datavalue":{"value":{"entity-type":"item","numeric-id":261849,"id":"Q261849"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6982689$1D9F1D8A-34B2-4EA9-B9AC-5F3BCDD8DD04","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"e564314c10fa5b362951b280af9f9f70fb290f3e","datavalue":{"value":"90C47","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6982689$CE3A486A-A113-42F8-8437-DC4866CC8B36","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"843de71235f44a800ae389e1734df6bb7650efec","datavalue":{"value":"65K10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6982689$04954526-F06D-44BF-9B09-9B3B0E310297","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed10a41ec587cb61dc683f25ef4b3e827c7fee2f","datavalue":{"value":"90C26","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6982689$8DC9A4A6-4DDE-48ED-8F42-105E155C1148","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"2ba7fe651ba0ef7552aab80ed19659efaffe9fc1","datavalue":{"value":"90C52","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6982689$C695357A-9D93-4013-924A-A8D06324EAD2","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"b0dac0d487ab0614f29a53d833759c22f7460852","datavalue":{"value":"8041960","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6982689$1F07651A-A00D-4CD8-87C6-E4F22F53008D","rank":"normal"}],"P163":[{"mainsnak":{"snaktype":"value","property":"P163","hash":"45fcd4163b5f33e6e8c784f5522d7246c0a1a61e","datavalue":{"value":{"entity-type":"item","numeric-id":57056,"id":"Q57056"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6982689$D3F358F1-CB39-4850-BBFD-A3BCE28DCD54","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a97009f7838b95f5aa1c9f8f42e7ad28401fc156","datavalue":{"value":"structured nonconvex minimax optimization","type":"string"},"datatype":"string"},"type":"statement","id":"Q6982689$6EDF6258-8DA6-4683-941B-9DD6D40EDEB8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1ec247af6cf6d6d5d8874f63d3f955f9a78f2d5d","datavalue":{"value":"two-timescale gradient descent ascent","type":"string"},"datatype":"string"},"type":"statement","id":"Q6982689$F09ACF9F-3863-4411-A56E-C4D4AFD3789F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c92177322dffd359821a3c5edfd982dfa11ec830","datavalue":{"value":"iteration complexity analysis","type":"string"},"datatype":"string"},"type":"statement","id":"Q6982689$2C595B2B-532A-4D5C-AED7-E3865B7D731E","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6982689$81987F56-4C90-4BC7-B739-D816B0F70591","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Two-timescale gradient descent ascent algorithms for nonconvex minimax optimization","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Two-timescale_gradient_descent_ascent_algorithms_for_nonconvex_minimax_optimization"}}}}}