A difference-of-convex programming approach with parallel branch-and-bound for sentence compression via a hybrid extractive model
From MaRDI portal
Publication:2230777
DOI10.1007/s11590-020-01695-9zbMath1477.90074arXiv2002.01352OpenAlexW3005140901MaRDI QIDQ2230777
Junpeng Hu, Songquan Yao, Wenxu Xu, Yu You, Yi-Shuai Niu, Wentao Ding
Publication date: 28 September 2021
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.01352
Related Items (1)
Uses Software
Cites Work
- Exact penalty and error bounds in DC programming
- Portfolio selection under downside risk measures and cardinality constraints based on DC programming and DCA
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Exact penalty in d. c. programming
- Summarization beyond sentence extraction: A probabilistic approach to sentence compression
- DC programming and DCA: thirty years of developments
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA
- A continuous approch for globally solving linearly constrained quadratic
- A DC Programming Approach for Mixed-Integer Linear Programs
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- DC programming approaches for discrete portfolio optimization under concave transaction costs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A difference-of-convex programming approach with parallel branch-and-bound for sentence compression via a hybrid extractive model
