Non-submodular Optimization and Non-convex Relaxation

Weili Wu (), Zhao Zhang (), Wei Li () and Ding-Zhu Du ()
Additional contact information
Weili Wu: University of Texas at Dallas, Department of Computer Science
Zhao Zhang: Zhejiang Normal University, School of Mathematics
Wei Li: Texas Southern University, Department of Computer Science
Ding-Zhu Du: University of Texas at Dallas, Department of Computer Science

A chapter in Theory, Algorithms, and Experiments in Applied Optimization, 2025, pp 377-391 from Springer

Abstract: Abstract Usually, non-submodular optimization problems are NP-hard. Therefore, design and analysis of approximation algorithms are important tasks in the study of non-submodular optimizations. However, the traditional methods do not work well. In this article, we give an extensive survey for recent developments in this research direction.

Keywords: Non-submodular optimization; Local optimality; Non-convex relaxation (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-031-91357-0_17

Ordering information: This item can be ordered from
http://www.springer.com/9783031913570

DOI: 10.1007/978-3-031-91357-0_17

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().