Login / Signup
On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization.
V. S. Amaral
Roberto Andreani
Ernesto G. Birgin
Diaulas S. Marcondes
José Mario Martínez
Published in:
J. Glob. Optim. (2022)
Keyphrases
</>
high order
constrained minimization
higher order
optimization problems
computational complexity
tensor analysis
pairwise
bayesian logistic regression
evolutionary algorithm
stationary points
markov random field
image restoration
fixed point
convergence rate
convex optimization