Representation of a Polynomial Function as a Difference of Convex Polynomials, with an Application-Reference-Cited by-同舟云学术

Representation of a Polynomial Function as a Difference of Convex Polynomials, with an Application

Published:2001 Issue: Volume: Page:189-207
ISSN:0075-8442
Container-title:Lecture Notes in Economics and Mathematical Systems
language:
Short-container-title:

Author:

Biosca Albert Ferrer

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-56645-5_13

Reference14 articles.

1. Avriel, M. (1976) Nonlinear programming Analysis and methods. Englewood Cliffs, NS Prentice-Hall.

2. Bougeard, M. (1978) Contribution à la théorie de Morse en dimension finie. Thèse de 3ème cycle de l’Université de Paris IX.

3. Chambadal, L., Ovaert, J.L. (1968) Algèbre linéaire et algèbre tensorielle. Dunod Université. Dunod, Paris.

4. Cox, D., Little, J., O’Shea, D. (1992) Ideals, varieties and algorithms. An introduction to computational algebraic geometry and commutative algebra. Undergraduate Texts in Mathematics. Springer-Verlag, New York.

5. Hartman, P. (1959) On functions representable as a difference of convex functions. Pacific Journal of Mathematics, 9, 707–713.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials;SIAM Journal on Optimization;2024-05-24

2. A Boosted-DCA with Power-Sum-DC Decomposition for Linearly Constrained Polynomial Programs;Journal of Optimization Theory and Applications;2024-04-09

3. Bundle Methods for Nonsmooth DC Optimization;Numerical Nonsmooth Optimization;2020

4. A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes;Journal of Global Optimization;2016-12-22

5. Solving DC programs using the cutting angle method;Journal of Global Optimization;2014-02-28