SIAM Journal on Optimization, Volume 10
Volume 10, Number 1, 1999
Yaroslav D. Sergeyev, Pasquale Daponte, Domenico Grimaldi, Anna Molinaro: Two Methods for Solving Optimization Problems Arising in Electronic Measurements and Electrical Engineering. 1-21- Guoliang Xue, Theodore P. Lillys, David E. Dougherty: Computing the Minimum Cost Pipe Network Interconnecting One Sink and Many Sources. 22-42
- C. T. Kelley: Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition. 43-55
- Linda Kaufman: Reduced Storage, Quasi-Newton Trust Region Approaches to Function Optimization. 56-69
- Frank K. Hwang, Shmuel Onn, Uriel G. Rothblum: A Polynomial Time Algorithm for Shaped Partition Problems. 70-81
- María J. Cánovas, Marco A. López, Juan Parra, Maxim I. Todorov: Stability and Well-Posedness in Linear Semi-Infinite Programming. 82-98
- Gang George Yin: Rates of Convergence for a Class of Global Stochastic Optimization Algorithms. 99-120
- R. R. Meyer, Golbon Zakeri: Multicoordination Methods for Solving Convex Block-Angular Programs. 121-131
- Dexuan Xie, Tamar Schlick: Efficient Implementation of the Truncated-Newton Algorithm for Large-Scale Chemistry Applications. 132-154
- Robert M. Freund, Jorge R. Vera: Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm. 155-176
- Clovis C. Gonzaga: Complexity of Predictor-Corrector Algorithms for LCP Based on a Large Neighborhood of the Central Path. 183-194
- Jun Ji, Florian A. Potra, Rongqin Sheng: On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming. 195-210
- Alfred Auslender: Penalty and Barrier Methods: A Unified Framework. 211-230
- Frank Deutsch, Wu Li, Joseph D. Ward: Best Approximation from the Intersection of a Closed Convex Set and a Polyhedron in Hilbert Space, Weak Slater Conditions, and the Strong Conical Hull Intersection Property. 252-268
- Paul Tseng: Fortified-Descent Simplicial Search Method: A General Approach. 269-288
- A. M. Rubinov, B. M. Glover, X. Q. Yang: Decreasing Functions with Applications to Penalization. 289-313
Volume 10, Number 2, 2000
- Houduo Qi: A Regularized Smoothing Newton Method for Box Constrained Variational Inequality Problems with P0-Functions. 315-330
- Yu-Hong Dai, Jiye Han, Guanghui Liu, Defeng Sun, Hongxia Yin, Ya-Xiang Yuan: Convergence Properties of Nonlinear Conjugate Gradient Methods. 345-358
- Wei-Bo Gong, Yu-Chi Ho, Wengang Zhai: Stochastic Comparison Algorithm for Discrete Optimization with Estimation. 384-404
- Stephen E. Wright: A General Primal-Dual Envelope Method for Convex Programming Problems. 405-414
- Hans-Jakob Lüthi, Benno Büeler: The Analytic Center Quadratic Cut Method for Strongly Monotone Variational Inequality Problems. 415-426
- Harvey J. Greenberg: Simultaneous Primal-Dual Right-Hand-Side Sensitivity Analysis from a Strictly Complementary Solution of a Linear Program. 427-442
- Steven J. Benson, Yinyu Ye, Xiong Zhang: Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization. 443-461
- Ming Gu: Primal-Dual Interior-Point Methods for Semidefinite Programming in Finite Precision. 462-502
- Manfred Laumen: Newton's Method for a Class of Optimal Shape Design Problems. 503-533
- Javier Peña: Understanding the Geometry of Infeasible Perturbations of a Conic Linear System. 534-550
- Mikhail V. Solodov, Benar Fux Svaiter: A Truly Globally Convergent Newton-Type Method for the Monotone Nonlinear Complementarity Problem. 605-625
Volume 10, Number 3, 2000
- Dimitri P. Bertsekas, John N. Tsitsiklis: Gradient Convergence in Gradient methods with Errors. 627-642
- Michael J. Best, Nilotpal Chakravarti, Vasant A. Ubhaya: Minimizing Separable Convex Functions Subject to Simple Chain Constraints. 658-672
- Stefan Feltenmark, Krzysztof C. Kiwiel: Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems. 697-721
- Malcolm C. Pullan: Convergence of a General Class of Algorithms for Separated Continuous Linear Programs. 722-731
- Darinka Dentcheva: Regular Castaing Representations of Multifunctions with Applications to Stochastic Programming. 732-749
- Masakazu Kojima, Levent Tunçel: Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets. 750-778
- Houyuan Jiang, Daniel Ralph: Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints. 779-808
- Teemu Pennanen: Dualization of Generalized Equations of Maximal Monotone Type. 809-835
- Shuzhong Zhang: Global Error Bounds for Convex Conic Problems. 836-851
- Jordi Castro: A Specialized Interior-Point Algorithm for Multicommodity Network Flows. 852-877
- Roberto Andreani, José Mario Martínez: Reformulation of Variational Inequalities on a Simplex and Compactification of Complementarity Problems. 878-895
- Kazufumi Ito, Karl Kunisch: Newton's Method for a Class of Weakly Singular Optimal Control Problems. 896-916
- Robert Michael Lewis, Virginia Torczon: Pattern Search Methods for Linearly Constrained Minimization. 917-941
Volume 10, Number 4, 2000
- J. J. Ye: Constraint Qualifications and Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints. 943-962
- Liqun Qi, Zengxin Wei: On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods. 963-981
- Wolfgang Achtziger, Martin P. Bendsøe, J. E. Taylor: An Optimization Problem for Predicting the Maximal Effect of Degradation of Mechanical Structures. 982-998
- L. R. Huang, K. F. Ng, J. P. Penot: On Minimizing and Critical Sequences in Nonsmooth Optimization. 999-1019
- Ines Campa, Marco Degiovanni: Subdifferential Calculus and Nonsmooth Critical Point Theory. 1020-1048
- Faiz A. Al-Khayyal, Hanif D. Sherali: On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems. 1049-1057
- Francisco Facchinei, Andreas Fischer, Christian Kanzow: On the Identification of Zero Variables in an Interior-Point Framework. 1058-1078
- José Luis Morales, Jorge Nocedal: Automatic Preconditioning by Limited Memory Quasi-Newton Updating. 1079-1096
- Alfred Auslender, Marc Teboulle: Lagrangian Duality and Related Multiplier Methods for Variational Inequality Problems. 1097-1115
- Mihai Anitescu: Degenerate Nonlinear Programming with a Quadratic Growth Condition. 1116-1135
- X. Wang, V. Jeyakumar: A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints. 1136-1148
- J. Z. Zhang, L. H. Chen, N. Y. Deng: A Family of Scaled Factorized Broyden-Like Methods for Nonlinear Least Squares Problems. 1163-1179
- Ernesto G. Birgin, José Mario Martínez, Marcos Raydan: Nonmonotone Spectral Projected Gradient Methods on Convex Sets. 1196-1211
- John E. Mitchell: Computational Experience with an Interior Point Cutting Plane Algorithm. 1212-1227
- Jos F. Sturm: Error Bounds for Linear Matrix Inequalities. 1228-1248
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T201401 by the dblp team