Decomposition Methods for Computing D-stationary Point

来源 :中国运筹学会第十四次学术年会 | 被引量 : 0次 | 上传用户：thardway

【摘要】

：

Outline:·A general nonconvex framework with minus max structure ·Two motivating problems ·Nonconvex group sparsity representation;·Generalized noncooperativ

【作者】

：

Min Tao

【机构】

：

DepartmentofMathematics,NanjingUniversity

【出处】

：

中国运筹学会第十四次学术年会

【发表日期】

：

2018年10期

下载到本地 , 更方便阅读

下载此文赞助VIP

声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架

论文部分内容阅读

Outline:·A general nonconvex framework with minus max structure ·Two motivating problems ·Nonconvex group sparsity representation;·Generalized noncooperative potential game;·d-(Directional derivative based) stationarity·Algorithms for computing d-stationarity·Deterministic algorithm·Randomized algorithm·Summary

其他文献

Maximum Likelihood Estimation By Monte Carlo SimulationTowards Data-Driven Stochastic Modeling

Outline 1 Motivation;2 Gradient-Based Simulated MLE;3 Distribution Sensitivities;4 Example and Conclusions

会议

Nonconvex and Nonsmooth Sparse Optimization via Adaptively Iteratively Reweighted Methods

Contents Introduction;Problem;Algorithms;Convergence Results;Experiments

会议

Level bundle method for constrained convex optimization with inexact oracle

Outline:1 Introduction;2 Algorithm;3 Convergence analysis 1.Introduction We consider the constrained nonsmooth optimization

会议

Optimal Estimation for Sparsity-Constrained Linear Model

Outline 1 Background and Motivation;2 Existence and Uniqueness;3 Optimal Variable Selection;4 Subspace Newton Algorithm;5 Numerical experiments;6 Concluding Rem

会议

Equilibrium Strategies in MM1 Priority Queues with Balking

CONTENTS:1 Motivation;2 Model description;3 The unobservable case;4 The observable case;5 Numerical examples;6 Conclusions

会议

Optimal Adaptive and Accelerated Stochastic Gradient Descent

Overview 1 Stochastic Gradient Descent;2 Adaptive and Accelerated Gradient Descent;3 Experiments

会议

Lower-order Regularization for Group Sparse Optimization with Applications

Outline 1 Story of Systems Biology;2 Group Sparse Optimization;3 Nonconvex Regularization Method;·Recovery Bound;·Proximal Gradient Algorithm

会议

Necessary Optimality Conditions for Nonsmooth Semivectorial Bilevel Optimization Problems with a Con

CONTENTS 1 Motivation;2 Bilevel Optimization Problems and Its Reformulation;3 Perturbed KKT Reformulation and Necessary Optimality Conditions;Zhenhua

会议

Convergence of Regularized Peaceman-Rachford Splitting method for minimizing two-blocks nonconvex pr

Contents:1 Introduction;2 Preliminaries and Assumption;3 Convergence Analysis;4 Numerical Experiment

会议

基于多标签学习的蛋白质修饰位点预测

蛋白质合成后期的一个重要生化反应,大多数蛋白质需要经过修饰进而行驶其生物功能。修饰类型多,现在发现的有350多种,常见的有几十种。异常修饰或者过多修饰跟很多疾病相关联

会议

蛋白质修饰位点预测多标签学习

Decomposition Methods for Computing D-stationary Point

与本文相关的学术论文