default search action
SIAM Journal on Optimization, Volume 4
Volume 4, Number 1, 1994
- Alexander D. Ioffe:
On Sensitivity Analysis of Nonlinear Programs in Banach Spaces: The Approach via Composite Unconstrained Optimization. 1-43 - Phan Thien Thach:
A Nonconvex Duality with Zero Gap and Applications. 44-64 - Dong X. Shaw, Donald Goldfarb:
A Path-Following Projective Interior Point Method for Linear Programming. 65-85 - Michael D. Grigoriadis, Leonid G. Khachiyan:
Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints. 86-107 - Jürgen Huschens:
On the Use of Product Structure in Secant Methods for Nonlinear Least Squares Problems. 108-129 - Alexander Shapiro:
Existence and Differentiability of Metric Projections in Hilbert Spaces. 130-141 - Shmuel Onn:
Approximating Oracle Machines for Combinatorial Optimization. 142-145 - Jonathan M. Borwein, Adrian S. Lewis:
Strong Rotundity and Optimization. 146-158 - José Mario Martínez:
Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres. 159-176 - Ana Friedlander, José Mario Martínez:
On the Maximization of a Concave Quadratic Function with Box Constraints. 177-192 - Jean-Louis Goffin, Jean-Philippe Vial:
Short Steps with Karmarkar's Projective Algorithm for Linear Programming. 193-207 - Yin Zhang:
On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem. 208-227
Volume 4, Number 2, 1994
- Walter Murray, Margaret H. Wright:
Line Search Procedures for the Logarithmic Barrier Function. 229-246 - Kevin A. McShane:
Superlinearly Convergent O(√(n) L)-Iteration Interior-Point Algorithms for Linear Programming and the Monotone Linear Complementarity Problem. 247-261 - Paul T. Boggs, Jon W. Tolle:
Convergence Properties of a Class of Rank-two Updates. 262-287 - Per S. Laursen:
Can Parallel Branch and Bound without Communication Be Effective? 288-296 - Peter N. Brown, Youcef Saad:
Convergence Theory of Nonlinear Newton-Krylov Algorithms. 297-330 - Ana Friedlander, José Mario Martínez, Sandra Augusta Santos:
On the Resolution of Linearly Constrained Convex Minimization Problems. 331-339 - Jirí V. Outrata:
On Optimization Problems with Variational Inequality Constraints. 340-357 - John E. Dennis Jr., José Mario Martínez, Xiaodong Zhang:
Triangular Decomposition Methods for Solving Reducible Nonlinear Systems of Equations. 358-382 - Xiaodong Luo, Zhi-Quan Luo:
Extension of Hoffman's Error Bound to Polynomial Systems. 383-392 - Stanley C. Eisenstat, Homer F. Walker:
Globally Convergent Inexact Newton Methods. 393-422 - John E. Mitchell:
An Interior Point Column Generation Method for Linear Programming Using Shifted Barriers. 423-440 - Sanjay Mehrotra, Robert A. Stubbs:
Predictor-corrector Methods for a Class of Linear Complementarity Problems. 441-453
Volume 4, Number 3, 1994
- Fred J. Rispoli:
The Monotonic Diameter of the Perfect 2-matching Polytope. 455-460 - Chaya Gurwitz:
Local Convergence of a Two-Piece Update of a Projected Hessian Matrix. 461-485 - Mustafa Ç. Pinar, Stavros A. Zenios:
On Smoothing Exact Penalty Functions for Convex Constrained Optimization. 486-511 - Jun Ji, Yinyu Ye:
A Complexity Analysis for Interior-Point Algorithms Based on Karmarkar's Potential Function. 512-520 - Ruoxin Zhang:
Problems of Hierarchical Optimization in Finite Dimensions. 521-536 - Zvi Artstein, Roger J.-B. Wets:
Stability Results for Stochastic Programs and Sensors, Allowing for Discontinuous Objective Functions. 537-550 - Dimitri P. Bertsekas, Paul Tseng:
Partial Proximal Minimization Algorithms for Convex Pprogramming. 551-572 - James V. Burke, Jorge J. Moré:
Exposing Constraints. 573-595 - Aharon Ben-Tal, Arkadii Nemirovskii:
Potential Reduction Polynomial Time Method for Truss Topology Design. 596-612 - Shinji Mizuno, Michael J. Todd, Levent Tunçel:
Monotonicity of Primal and Dual Objective Values in Primal-dual Interior-point Algorithms. 613-625 - Bradley M. Bell:
The Iterated Kalman Smoother as a Gauss-Newton Method. 626-636 - Hubertus Th. Jongen, Jan-J. Rückmann, Gerd-Wilhelm Weber:
One-Parametric Semi-Infinite Optimization: On the Stability of the Feasible Set. 637-648 - Jean-Pierre Crouzeix, Abdelhak Hassouni:
Quasimonotonicity of Separable Operators and Monotonicity Indices. 649-658 - Mohamed Moussaoui, Alberto Seeger:
Sensitivity Analysis of Optimal Value Functions of Convex Parametric Programs with Possibly Empty Solution Sets. 659-675 - David Hartvigsen, William R. Pulleyblank:
Outer-Facial Graphs and the Traveling Salesman Problem. 676-689
Volume 4, Number 4, 1994
- John H. Glick, J. Ben Rosen:
Large-Scale, Nonlinearly Constrained Optimization on a 1024-Processor nCUBE. 691-707 - Brett M. Averick, Jorge J. Moré:
Evaluation of Large-scale Optimization Problems on Vector and Parallel Architectures. 708-721 - Kristin P. Bennett, Olvi L. Mangasarian:
Serial and Parallel Multicategory Discrimination. 722-734 - Adam J. Berger, John M. Mulvey, Andrzej Ruszczynski:
An Extension of the DQA Algorithm to Convex Stochastic Programs. 735-753 - Evin J. Cramer, John E. Dennis Jr., Paul D. Frank, Robert Michael Lewis, Gregory R. Shubin:
Problem Formulation for Multidisciplinary Optimization. 754-776 - Renato De Leone, Robert R. Meyer, Spyridon Kontogiorgis, Armand Zakarian, Golbon Zakeri:
Coordination in Coarse-Grained Decomposition. 777-793 - Jonathan Eckstein:
Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5. 794-814 - Michael C. Ferris, Olvi L. Mangasarian:
Parallel Variable Distribution. 815-832 - Elizabeth R. Jessup, Dafeng Yang, Stavros A. Zenios:
Parallel Factorization of Structured Matrices Arising in Stochastic Programming. 833-846 - Linda Kaufman, Garrett S. Sylvester, Margaret H. Wright:
Structured Linear Least-Squares Problems in System Identification and Separable Nonlinear Data Fitting. 847-871 - Jong-Shi Pang:
Serial and Parallel Computation of Karush-Kuhn-Tucker Points via Nonsmooth Equations. 872-893 - Klaus Ritter, Stefan Schäffler:
A Stochastic Method for Constrained Global Optimization. 894-904
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.