Richard H. Bartels
- 1 ARMSTRONG, R D, AND HULTZ, J.W. An algorithm for a restricted discrete approximation m the L~ norm. SIAM J Numer Anal. 14 (1977), 555-565Google Scholar
- 2 BARTELS, R H, CONN, A.R, AND CHARALAMBOUS, C On Cline's direct method for solving overdetermined systems on the l~ sense SIAM J Numer Anal 15 (1978), 255-270.Google Scholar
- 3 BARTELS, R H, CONN, A R, AND SINCLAIR, J.W. Minimization techmques for plecewise differentlable functions--The It solution to an overdetermined hnear system SIAM J Numer. Anal. 15 (1978), 224-241Google Scholar
- 4 CONN, A R, AND PIETRZYKOWSKI, T. A penalty-function method converging directly to a constrained optimum SIAM J Numer Anal 14 (1977), 348-375Google Scholar
- 5 KNUTH, D.E. The Art of Computer Programming, Vol. 3, "Sorting and Searching" Addison Wesley, Reading, Mass., 1975 Google Scholar
- 6 LawsoN, C.L., HANSON, R.J., KINCAID, D.R., AND KROGH, F.T. Basic linear algebra subprograms for Fortran usage. ACM Trans. Math Softw. 5, 3 (Sept 1979), 308-323. Google Scholar
- 7 RYDER, B.G. The PFORT verifier. Software Practice and Experzence 4 (1974), 359-377Google Scholar
Index Terms
- Linearly Constrained Discrete I1 Problems
Recommendations
ICHEA for discrete constraint satisfaction problems
AI'12: Proceedings of the 25th Australasian joint conference on Advances in Artificial IntelligenceConstraint satisfaction problem (CSP) is a subset of optimization problem where at least one solution is sought that satisfies all the given constraints. Presently, evolutionary algorithms (EAs) have become standard optimization techniques for solving ...
A General Updating Algorithm for Constrained Linear Least Squares Problems
Linear least squares problems which are sparse except for a small subset of dense equations can be efficiently solved by an updating method. Often the least squares solution is also required to satisfy a set of linear constraints, which again can be ...
Applying EGENET to Solve Continuous Constrained Optimization Problems: A Preliminary Report
ICIIS '99: Proceedings of the 1999 International Conference on Information Intelligence and SystemsGENET and its extended model EGENET are artificial neural networks to efficiently solve finite constraint satisfaction problems such as the car-sequencing problems. Both models use the min-conflict heuristic to update every finite-domain variable for ...
Comments