article

Free access

Pracniques: construction of nonlinear programming test problems

Authors:

J. B. Rosen,

S. SuzukiAuthors Info & Claims

Communications of the ACM, Volume 8, Issue 2

Page 113

https://doi.org/10.1145/363744.363779

Published: 01 February 1965 Publication History

PDF eReader

Abstract

No abstract available.

Cited By

View all

Maleknia MShamsi M(2022)A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functionsOptimization Methods and Software10.1080/10556788.2021.202352237:4(1415-1446)Online publication date: 14-Feb-2022
https://doi.org/10.1080/10556788.2021.2023522
Cegielski ANimana N(2018)Extrapolated cyclic subgradient projection methods for the convex feasibility problems and their numerical behaviourOptimization10.1080/02331934.2018.1509214(1-17)Online publication date: 21-Aug-2018
https://doi.org/10.1080/02331934.2018.1509214
Johnson TKirches CWaźchter A(2015)An Active-Set Method for Quadratic Programming Based On Sequential Hot-StartsSIAM Journal on Optimization10.1137/13094038425:2(967-994)Online publication date: 7-May-2015
https://dl.acm.org/doi/10.1137/130940384
Show More Cited By

Index Terms

Pracniques: construction of nonlinear programming test problems
1. Mathematics of computing
  1. Mathematical analysis
    1. Mathematical optimization
    2. Nonlinear equations
2. Theory of computation
  1. Design and analysis of algorithms
    1. Mathematical optimization

Recommendations

Exact and inexact newton linesearch interior-point algorithms for nonlinear programming problems
Global Methods for Nonlinear Complementarity Problems

Global methods for nonlinear complementarity problems formulate the problem as a system of nonsmooth nonlinear equations, or use continuation to trace a path defined by a smooth system of nonlinear equations. We formulate the nonlinear complementarity ...
A New Nonsmooth Equations Approach to Nonlinear Complementarity Problems

Based on Fischer's function, a new nonsmooth equations approach is presented for solving nonlinear complementarity problems. Under some suitable assumptions, a local and Q-quadratic convergence result is established for the generalized Newton method ...

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 8, Issue 2

Feb. 1965

71 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/363744

Editor:
C. C. Gotlieb
Univ. of Toronto, Toronto, Ont., Canada

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 February 1965

Published in CACM Volume 8, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

103
Total Citations
View Citations
415
Total Downloads

Downloads (Last 12 months)54
Downloads (Last 6 weeks)11

Reflects downloads up to 21 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Maleknia MShamsi M(2022)A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functionsOptimization Methods and Software10.1080/10556788.2021.202352237:4(1415-1446)Online publication date: 14-Feb-2022
https://doi.org/10.1080/10556788.2021.2023522
Cegielski ANimana N(2018)Extrapolated cyclic subgradient projection methods for the convex feasibility problems and their numerical behaviourOptimization10.1080/02331934.2018.1509214(1-17)Online publication date: 21-Aug-2018
https://doi.org/10.1080/02331934.2018.1509214
Johnson TKirches CWaźchter A(2015)An Active-Set Method for Quadratic Programming Based On Sequential Hot-StartsSIAM Journal on Optimization10.1137/13094038425:2(967-994)Online publication date: 7-May-2015
https://dl.acm.org/doi/10.1137/130940384
Ng CLi D(2014)Test problem generator for unconstrained global optimizationComputers and Operations Research10.1016/j.cor.2014.06.01951(338-349)Online publication date: 1-Nov-2014
https://dl.acm.org/doi/10.1016/j.cor.2014.06.019
Kostreva MChen XKorycki J(2013)A norm-relaxed method of feasible directions (MFD) for solving nonlinear programming problems6th Symposium on Multidisciplinary Analysis and Optimization10.2514/6.1996-4006Online publication date: 20-Feb-2013
https://doi.org/10.2514/6.1996-4006
Abadie JDayan HAkoka J(2011)Quelques expériences numériques sur la programmation non linéaire en nombres entiersRevue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle10.1051/ro/197610V30065110:V3(65-70)Online publication date: 29-Mar-2011
https://doi.org/10.1051/ro/197610V300651
Christofides N(2011)The vehicle routing problemRevue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle10.1051/ro/197610V10055110:V1(55-70)Online publication date: 29-Mar-2011
https://doi.org/10.1051/ro/197610V100551
Lu SSingh S(2011)Local Linear Convergence of an Outer Approximation Projection Method for Variational InequalitiesJournal of Optimization Theory and Applications10.1007/s10957-011-9873-8151:1(52-63)Online publication date: 1-Oct-2011
https://dl.acm.org/doi/10.1007/s10957-011-9873-8
Wakahara TNoda MNishitani H(2010)Decomposition Method for Nonlinear Programming Problems of Chemical ProcessesKAGAKU KOGAKU RONBUNSHU10.1252/kakoronbunshu.36.51236:5(512-518)Online publication date: 2010
https://doi.org/10.1252/kakoronbunshu.36.512
Sandgren ERagsdell K(2009)On some experiments which delimit the utility of nonlinear programming methods for engineering designAlgorithms for Constrained Minimization of Smooth Nonlinear Functions10.1007/BFb0120950(118-136)Online publication date: 25-Feb-2009
https://doi.org/10.1007/BFb0120950
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

Exact and inexact newton linesearch interior-point algorithms for nonlinear programming problems

Global Methods for Nonlinear Complementarity Problems

A New Nonsmooth Equations Approach to Nonlinear Complementarity Problems

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

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations