ÉϺ£ÖÎÀíÂÛ̳µÚ536ÆÚ
±êÌ⣺Éý¸ßʽÖð²½½âñîËã·¨µÄÊÕÁ²¿ìÂÊÓë²ÎÊýÑ¡Ôñ
Ñݽ²ÈË£ºËï½Ý½ÌÊÚ£¬¿ÆÍ¢´óѧÊýѧͳ¼Æϵ
Ö÷³ÖÈË£ºÁֹ󻪽ÌÊÚ£¬Ð±¦GGÖÎÀíѧԺ
¹¦·ò£º2024Äê10ÔÂ30ÈÕ£¨ÖÜÈý£©£¬ÏÂÎç15:30
µØÖ·£ºÐ±¦GGУ±¾²¿¶«Çø1ºÅÂ¥ÖÎÀíѧԺ420»áÒéÊÒ
Ö÷°ìµ¥Ôª£ºÐ±¦GGÖÎÀíѧԺ¡¢Ð±¦GGÖÎÀíѧԺÇàÀÏ´óʦÁªÒê»á
Ñݽ²È˼ò½é£º
Ëï½Ý£¬¹ú¼Ê³ÛÃûÓÅ»¯×¨¼Ò£¬¿ÆÍ¢´óѧÊýѧͳ¼Æϵ׿Խ×êÑнÌÊÚ£¬°Ä´óÀûÑÇÊýѧ»á»áÊ¿£¬Ð¼ÓƹúÁ¢´óѧ׿Խ´óѧ×êÑÐÕß½±»ñµÃÕߣ¬ÔÚÄÚµãËã·¨¡¢·Ç¹â»¬Å£¶ÙËã·¨¡¢Ëæ»ú±ä·Ö²»µÈʽµÈ·½Ïò¾ùÓÐ׿Խ¹±Ï×£¬ËûÔÚ1993ÄêÁªÃû°ä·¢µÄһƪÂÛÎÄÔÚ2003Äê±»ÆÀΪ¡°´ÓÇ°10ÄêÒýÓÃÂÊ×î¸ßµÄÊýѧ¼°Í³¼ÆѧÂÛÎÄ¡±Ö®Ò»£¬ËûÒ²Êǹú¼ÊÐÅÏ¢¿ÆѧѧԺÆÀ³öµÄ2002-2012Æڼ䱻ÒýÓÃÂÊ×î¸ßµÄѧÕßÖ®Ò» ¡£ÔøÂÅ´ÎÊÜÑûÔÚ¹ú¼Ê»áÒéÉÏ×ö´ó»áÑݽ²£¬²¢Ó¦Ñûµ£ÈÎÃÀÓ¢µÂÈյȹú¶àÖÖѧÊõÔÓÖ¾µÄÖ÷±à»ò¸±Ö÷±à ¡£
Ñݽ²ÄÚÈݼò½é£º
We study the progressive decoupling algorithm (PDA) of Rockafellar and focus on the elicited version of the algorithm. Based on a generalized Yosida-regularization of Spingarn¡¯s partial inverse of an elicitable operator, it is shown that the elicited progressive decoupling algorithm (EPDA), in a particular nonmonotone setting, linearly converges at a rate that could be viewed as the rate of a rescaled PDA, which may provide certain guidance to the selection of the parameters in computational practice. A preliminary numerical experiment shows that the choice of the elicitation constant has an impact on the efficiency of the EPDA. It is also observed that the influence of the elicitation constant is generally weaker than the proximal constant in the algorithm.
Ó½Ó¿í´óʦÉú²ÎÓ룡
