Complexity of partially separable convexly constrained optimization with non-Lipschitzian singularities

Xiaojun Chen, Philippe Toint, Hong Wang

Namur Institute for Complex Systems

Research output: Contribution to journal › Article › peer-review

34 Downloads (Pure)

10 Citations
7 Article
2 Working paper
1 Book
1 Chapter

7 results

Filter

2021
High-Order Evaluation Complexity for Convexly-Constrained Optimization with Non-Lipschitzian Group Sparsity Terms
Chen, X. & Toint, P., May 2021, In: Mathematical Programming. 187, 1-2, p. 47-78 32 p.
Research output: Contribution to journal › Article › peer-review

Open Access
File
40 Downloads (Pure)
2020
Adaptive regularization algorithms with inexact evaluations for nonconvex optimization
Bellavia, S., Gurioli, G., Morini, B. & Toint, P., 2 Jan 2020, In: SIAM Journal on Optimization. 29, 4, p. 2881-2915 35 p.
Research output: Contribution to journal › Article › peer-review

Open Access
File
48 Downloads (Pure)
2019
Optimality of orders one to three and beyond: Characterization and evaluation complexity in constrained nonconvex optimization
Cartis, C., Gould, N. I. M. & Toint, P., 10 Aug 2019, In: Journal of Complexity. 53, p. 68-94 32 p.
Research output: Contribution to journal › Article › peer-review

Open Access
File
37 Downloads (Pure)
2017
Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
Birgin, E. G., Gardenghi, J. L., Martínez, J. M., Santos, S. A. & Toint, P. L., 15 Apr 2017, In: Mathematical Programming. 163, 1-2, p. 359-368 10 p.
Research output: Contribution to journal › Article › peer-review
Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients
Toint, P., 2 Nov 2017, In: Optimization Methods and Software. 32, 6, p. 1273-1298 26 p.
Research output: Contribution to journal › Article › peer-review

Open Access
File
24 Downloads (Pure)
2016
Evaluation complexity for nonlinear constrained optimization using unscaled KKT conditions and high-order models
Birgin, E., Gardenghi, J., Martinez, J.-M., Santos, S. & Toint, P., 2016, In: SIAM Journal on Optimization. 26, 2, 20 p.
Research output: Contribution to journal › Article › peer-review

File
40 Downloads (Pure)
2014
On the complexity of finding first-order critical points in constrained nonlinear optimization
Cartis, C., Gould, N. I. M. & Toint, P. L., 2014, In: Mathematical Programming. 144, 1-2, p. 93-106 14 p.
Research output: Contribution to journal › Article › peer-review

File
62 Downloads (Pure)

Complexity of partially separable convexly constrained optimization with non-Lipschitzian singularities

Research output

Search results

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

Adaptive regularization algorithms with inexact evaluations for nonconvex optimization

Optimality of orders one to three and beyond: Characterization and evaluation complexity in constrained nonconvex optimization

Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models

Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients

Evaluation complexity for nonlinear constrained optimization using unscaled KKT conditions and high-order models

On the complexity of finding first-order critical points in constrained nonlinear optimization