activity
20132022
most citedComputations and Complexities of Tarski's Fixed Points and Supermodular Games

5 citations · 6 across the 5 of their papers we have counts for

collaborators

5 papers

math.OC2022

Exact Penalty Algorithm of Strong Convertible Nonconvex Optimization

Min Jiang, Rui Shen, Zhiqing Meng +1

This paper defines a strong convertible nonconvex(SCN) function for solving the unconstrained optimization problems with the nonconvex or nonsmooth(nondifferentiable) function. Fir…

math.OC2022

Optimization Condition and Algorithm of Optimization with Convertible Nonconvex Function

Min Jiang, Rui Shen, Zhiqing Meng +1

The paper introduces several new concepts for solving nonconvex or nonsmooth optimization problems, including convertible nonconvex function, exact convertible nonconvex function a…

cs.GT2020★ 5 cited

Computations and Complexities of Tarski's Fixed Points and Supermodular Games

Chuangyin Dang, Qi Qi, Yinyu Ye

We consider two models of computation for Tarski's order preserving function f related to fixed points in a complete lattice: the oracle function model and the polynomial function…

math.OC2018

A new alternating direction trust region method based on conic model for solving unconstrained optimization

Honglan Zhu, Qin Ni, Chuangyin Dang

In this paper, a new alternating direction trust region method based on conic model is used to solve unconstrained optimization problems. By use of the alternating direction method…

cs.DM2013★ 1 cited

A Comparative Study of the Signal-to-Noise Ratios of Different Representations for Symbolic Sequences

Jiasong Wang, Chuangyin Dang, Changchuan Yin

Based on the numerical representations by T basic vectors of a symbolic sequence consisting of T symbols, first, we prove mathematical that the total Fourier spectrum of the sequen…