Scholarlink

This paper aims to give a brief introduction to the concept of computational complexity in the context of continuous (nonconvex) nonlinear optimization.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A Concise and Friendly Introduction to the Analysis of Algorithms for Continuous Nonlinear Optimization

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Ernesto G. Birgin

摘要

This paper aims to give a brief introduction to the concept of computational complexity in the context of continuous (nonconvex) nonlinear optimization.