Departement of Applied Mathematics, Polytechnic University of Hong Kong

Related content

• Projects

• ADALGOPT - Advanced algorithms in nonlinear optimization

  Project: Research Axis

• Complexity in nonlinear optimization

  Project: Research

• Research output

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

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

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

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

• Second-order optimality and beyond: Characterization and Evaluation Complexity in Convexly Constrained Nonlinear Optimization

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

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

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

• Adaptive regularization algorithms with inexact evaluations for nonconvex optimization

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

• Activities

• Recent results in worst-case evaluation complexity for smooth and non-smooth, exact and inexact, nonconvex optimization

  Activity: Talk or presentation types › Invited talk

• University of Oxford

  Activity: Visiting an external institution types › Visiting an external academic institution

• Polytechnic University of Hong Kong

  Activity: Visiting an external institution types › Visiting an external academic institution

• Recent Advances in Evaluation Complexity for Nonconvex Optimization

  Activity: Talk or presentation types › Invited talk

• Recent topics in complexity for nonconvex optimization problems

  Activity: Talk or presentation types › Invited talk