article

The rise of nonlinear mathematical programming

Author:

D. McAllesterAuthors Info & Claims

ACM Computing Surveys (CSUR), Volume 28, Issue 4es

Pages 68 - es

https://doi.org/10.1145/242224.242311

Published: 01 December 1996 Publication History

Abstract

No abstract available.

Supplementary Material

PS File (a68-mcallester.ps)

Download
67.62 KB

References

[1]

W. Older and A. Vellino. Extending Prolog with Constraint Arithmetics on Real Intervals. In Canadian Conference on Computer & Electrical Engineering, Ottawa, 1990.

Google Scholar

[2]

F. Benhamou and W. Older. Applying Interval Arithmetic to Real, Integer and Boolean Constraints. Journal of Logic Programming, 1995. To Appear.

Google Scholar

[3]

P. van Hentenryck. Constraint Satisfaction in Logic Programming . Logic Programming Series, The MIT Press, Cambridge, MA, 1989.

Crossref

Google Scholar

[4]

P. van Hentenryck, D. McAllester, and D. Kapur Solving Polynomial Systems using a Branch and Prune Approach . to appear, SIAM Journal of Numerical Analysis, also available through http://www.ai.mit.edu/people/dam/dam.html

Crossref

Google Scholar

[5]

R.E. Moore. Interval Analysis . Prentice-Hall, Englewood Cli~s, NJ, 1966.

Google Scholar

[6]

A.P. Morgan. Solving Polynomial Systems Using Continuation for Scienti~c and Engineering Problems . Prentice-Hall, Englewood Cli~s, NJ, 1987.

Google Scholar

[7]

E.R. Hansen and R.I. Greenberg. An Interval Newton Method. Appl. Math. Comput., 12:89{ 98, 1983.

Google Scholar

[8]

E.R. Hansen and S. Sengupta. Bounding Solutions of Systems of Equations Using Interval Analysis. BIT, 21:203{211, 1981.

Google Scholar

[9]

H. Hong and V. Stahl. Safe Starting Regions by Fixed Points and Tightening. To Appear in Computing, 1995.

Google Scholar

[10]

K. Meintjes and A.P. Morgan. Chemical Equilibrium Systems as Numerical test Problems. ACM Transactions on Mathematical Software, 16:143{151, 1990.

Crossref

Google Scholar

[11]

R.E. Moore and S.T. Jones. Safe Starting Regions for Iterative Methods. SIAM Journal on Numerical Analysis, 14:1051{1065, 1977.

Google Scholar

[12]

J.J. More and M.Y. Cosnard. Numerical Solution of Nonlinear Equations. ACM Transactions on Mathematical Software, 5:64{85, 1979.

Crossref

Google Scholar

[13]

A.P. Morgan. Computing All Solutions To Polynomial Systems Using Homotopy Continuation. Appl. Math. Comput., 24:115{138, 1987.

Crossref

Google Scholar

[14]

J Verschelde, P. Verlinden, and R. Cools. Homotopies Exploiting Newton Polytopes For Solving Sparse Polynomial Systems. SIAM Journal on Numerical Analysis, 31(3):915{ 930, 1994.

Crossref

Google Scholar

Cited By

View all

Milano MVan Hentenryck P(2014)Looking into the crystal-ball: a bright future for CPConstraints10.1007/s10601-014-9160-z19:2(121-125)Online publication date: 9-Mar-2014
https://doi.org/10.1007/s10601-014-9160-z
Banerjee NAgarwal SBahl PChandra RWolman ACorner M(2010)Virtual compassProceedings of the 8th international conference on Pervasive Computing10.1007/978-3-642-12654-3_1(1-21)Online publication date: 17-May-2010
https://dl.acm.org/doi/10.1007/978-3-642-12654-3_1
Dai CLin DKantarcioglu MBertino ECelikel EThuraisingham B(2009)Query Processing Techniques for Compliance with Data Confidence PoliciesProceedings of the 6th VLDB Workshop on Secure Data Management10.1007/978-3-642-04219-5_4(49-67)Online publication date: 30-Aug-2009
https://dl.acm.org/doi/10.1007/978-3-642-04219-5_4

Recommendations

Computing exact solution to nonlinear integer programming: Convergent Lagrangian and objective level cut method

In this paper, we propose a convergent Lagrangian and objective level cut method for computing exact solution to two classes of nonlinear integer programming problems: separable nonlinear integer programming and polynomial zero-one programming. The ...
Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling

We consider the solution of nonlinear programs with nonlinear semidefiniteness constraints. The need for an efficient exploitation of the cone of positive semidefinite matrices makes the solution of such nonlinear semidefinite programs more complicated ...
Reformulations in mathematical programming: automatic symmetry detection and exploitation

If a mathematical program has many symmetric optima, solving it via Branch-and-Bound techniques often yields search trees of disproportionate sizes; thus, finding and exploiting symmetries is an important task. We propose a method for automatically ...

Comments

Information & Contributors

Information

Published In

ACM Computing Surveys Volume 28, Issue 4es

Special issue: position statements on strategic directions in computing research

Dec. 1996

8 pages

ISSN:0360-0300

EISSN:1557-7341

DOI:10.1145/242224

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 1996

Published in CSUR Volume 28, Issue 4es

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
379
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 23 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Milano MVan Hentenryck P(2014)Looking into the crystal-ball: a bright future for CPConstraints10.1007/s10601-014-9160-z19:2(121-125)Online publication date: 9-Mar-2014
https://doi.org/10.1007/s10601-014-9160-z
Banerjee NAgarwal SBahl PChandra RWolman ACorner M(2010)Virtual compassProceedings of the 8th international conference on Pervasive Computing10.1007/978-3-642-12654-3_1(1-21)Online publication date: 17-May-2010
https://dl.acm.org/doi/10.1007/978-3-642-12654-3_1
Dai CLin DKantarcioglu MBertino ECelikel EThuraisingham B(2009)Query Processing Techniques for Compliance with Data Confidence PoliciesProceedings of the 6th VLDB Workshop on Secure Data Management10.1007/978-3-642-04219-5_4(49-67)Online publication date: 30-Aug-2009
https://dl.acm.org/doi/10.1007/978-3-642-04219-5_4

Abstract

Supplementary Material

References

Cited By

Recommendations

Computing exact solution to nonlinear integer programming: Convergent Lagrangian and objective level cut method

Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling

Reformulations in mathematical programming: automatic symmetry detection and exploitation

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations