activity
20192022
most citedHigh-Order Evaluation Complexity for Convexly-Constrained Optimization with Non-Lipschitzian Group Sparsity Terms

2 citations · 3 across the 3 of their papers we have counts for

collaborators
Showing math.OCShow all

1 paper · 1 filter

math.OC2019★ 2 cited

High-Order Evaluation Complexity for Convexly-Constrained Optimization with Non-Lipschitzian Group Sparsity Terms

X. Chen, Ph. L. Toint

This paper studies high-order evaluation complexity for partially separable convexly-constrained optimization involving non-Lipschitzian group sparsity terms in a nonconvex objecti…