Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization

We propose a first order interior point algorithm for a class of non-Lipschitz and nonconvex minimization problems with box constraints, which arise from applications in variable selection and regularized optimization. The objective functions of these problems are continuously differentiable typical...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Mathematical programming Ročník 149; číslo 1-2; s. 301 - 327
Hlavní autoři:	Bian, Wei, Chen, Xiaojun, Ye, Yinyu
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.02.2015 Springer Nature B.V
Témata:	Algorithms Analysis Applied mathematics Calculus of Variations and Optimal Control; Optimization Combinatorics Complexity Complexity theory Feature selection First order algorithms Full Length Paper Iterative methods Mathematical analysis Mathematical and Computational Physics Mathematical Methods in Physics Mathematical models Mathematical programming Mathematics Mathematics and Statistics Mathematics of Computing Minimization Numerical Analysis Optimization Optimization techniques Regularization methods Studies Texts Theoretical Complexity analysis Second order algorithm 90C30 65K05 Constrained non-Lipschitz optimization Interior point method 90C26 49M37 First order algorithm
ISSN:	0025-5610, 1436-4646
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!