性能估计工具箱 (PESTO) 的代码，其目的是简化对 PEP 方法的访问，以便对凸和非凸优化中的一阶方法执行最坏情况分析
版权申诉
197 浏览量
2022-06-07
09:49:57
上传
评论
收藏 1.12MB ZIP 举报
性能估计工具箱 (PESTO) 的代码，其目的是简化对 PEP 方法的访问，以便对凸和非凸优化中的一阶方法执行最坏情况分析 （128个子文件） 
bib_.bib 18KB LICENSE 1KB pep.m 23KB matrix.m 14KB demo2.m 7KB Evaluable.m 7KB demo1.m 6KB A_DecentralizedGradientDescent.m 6KB D_AccDNGD.m 6KB C_DIGing_rate.m 6KB B_DIGing.m 5KB inexact_proximal_step.m 5KB functionClass.m 5KB Point.m 4KB functionHandler.m 4KB J_AcceleratedDouglasRachfordSplitting.m 3KB C_DirectAccelerationSAGA.m 3KB C_DouglasRachfordSplitting.m 3KB K_ThreeOperatorSplitting.m 3KB B_FastProximalPointMethod.m 3KB F_ProximalOptimizedGradientMethod.m 3KB H_DouglasRachfordSplitting_takeI.m 3KB A_Minimizer_of_a_sum.m 3KB P_ImprovedInteriorGradientAlgorithm_noConstraint.m 3KB E_AcceleratedInexactForwardBackward.m 3KB O_ImprovedInteriorGradientAlgorithm.m 3KB CompositeFunction.m 3KB A_SAGA.m 3KB I_DouglasRachfordSplitting_takeII.m 3KB D_AcceleratedHybridProximalExtraGradient.m 3KB O_StronglyConvexRobustMomentumMethod.m 3KB M_NoLips_takeII.m 2KB Expression.m 2KB A_ProximalPointMethod.m 2KB demo.m 2KB C_NoLips.m 2KB B_NoLips.m 2KB F_PartiallyInexactDouglasRachfordSplitting.m 2KB Scaled_Function.m 2KB B_PointSAGA.m 2KB L_NoLips_takeI.m 2KB B_ProximalPointMethod.m 2KB N_StronglyConvexTripleMomentumMethod.m 2KB SmoothConvexBoundedGradient.m 2KB J_OptimizedGradientMethod.m 2KB test_install.m 2KB L_OptimizedGradientMethodForGradient.m 2KB A_ProximalPointMethod.m 2KB I_ConjugateGradientMethod.m 2KB C_FastGradientDescent.m 2KB PrExpression.m 2KB Q_InexactGradientExactLineSearch.m 2KB K_OptimizedGradientMethod_ExactLineSearch.m 2KB plotSmoothInterp.m 2KB F_GradientExactLineSearch.m 2KB G_ConditionalGradient.m 2KB C_SubgradientMethod.m 2KB D_SGD_stronglyconvex.m 2KB ConvexBoundedGradient.m 2KB P_InexactFastGradientMethod.m 2KB E_SGD_overparametrized.m 2KB N_BregmanProximalPointMethod.m 2KB ConvexSupport.m 2KB A_GradientDescent.m 2KB D_ThreeOperatorSplitting.m 2KB C_OptimizedRelativelyInexactProximalPointAlgorithm.m 2KB D_FastProjectedGradientMethod.m 2KB E_FastProximalGradientMethod.m 2KB D_SubgradientMethod_ExactLineSearch.m 2KB Constraint.m 2KB StronglyConvexBoundedDomain.m 2KB SmoothStronglyConvex.m 2KB H_FastGradientMethod.m 2KB B_GradientDescent_takeII.m 2KB B_PolyakStepsTakeII.m 2KB A_PolyakStepsTakeI.m 2KB M_StronglyConvexFastGradientMethod.m 2KB B_RelativelyInexactProximalPointAlgorithm.m 2KB A_RelativelyInexactProximalPointAlgorithm.m 2KB G_HeavyBallMethod.m 2KB CocoerciveStronglyMonotone.m 2KB B_ProjectedGradientMethod.m 2KB LipschitzStronglyMonotone.m 2KB pesto.m 2KB C_ProximalGradientMethod.m 2KB A_ProximalPointMethod.m 2KB inexactsubgradient.m 2KB E_GradientMethod.m 1KB ConvexIndicator.m 1KB Smooth.m 1KB mirror_prox.m 1KB B_AcceleratedProximalPoint.m 1KB exactlinesearch_step.m 1KB A_ProximalPointMethod.m 1KB A_GradientMethod.m 1KB A_KrasnoselskiiMann.m 1KB StronglyMonotone.m 1KB Lipschitz.m 1KB Cocoercive.m 1KB mirror.m 1KB共 128 条
- 1
- 2
资源评论
