Journal: SIAM Journal on Optimization

Volume 11, Issue 4

859 -- 869I. D. Coope, C. J. Price. On the Convergence of Grid-Based Methods for Unconstrained Optimization
870 -- 888Etienne de Klerk, Jiming Peng, Cees Roos, Tamás Terlaky. A Scaled Gauss--Newton Primal-Dual Search Direction for Semidefinite Optimization
889 -- 917Michael Ulbrich. Nonmonotone Trust-Region Methods for Bound-Constrained Semismooth Equations with Applications to Nonlinear Mixed Complementarity Problems
918 -- 936Stefan Scholtes. Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
937 -- 961Elijah Polak, Liqun Qi, Defeng Sun. Second-Order Algorithms for Generalized Finite and Semi-Infinite Min-Max Problems
962 -- 973Yun-Bin Zhao, Duan Li. Monotonicity of Fixed Point and Normal Mappings Associated with Variational Inequality and Its Application
974 -- 1002Nicholas I. M. Gould, Dominique Orban, Annick Sartenaer, Philippe L. Toint. Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming
1003 -- 1018Simeon Reich, Alexander J. Zaslavski. The Set of Divergent Descent Methods in a Banach Space is /boldmathSigma/unboldmath-Porous
1019 -- 1036Qun Chen, Michael C. Ferris. FATCOP: A Fault Tolerant Condor-PVM Mixed Integer Programming Solver
1037 -- 1053Xianping Guo, Peng Shi. Limiting Average Criteria For Nonstationary Markov Decision Processes
1054 -- 1064Dong-Hui Li, Masao Fukushima. On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems
1065 -- 1080Petra Mutzel. An Alternative Method to Crossing Minimization on Hierarchical Graphs
1081 -- 1091Michael D. Grigoriadis, Leonid G. Khachiyan, Lorant Porkolab, J. Villavicencio. Approximate Max-Min Resource Sharing for Structured Concave Optimization
1092 -- 1118Craig T. Lawrence, André L. Tits. A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
1119 -- 1144X. Q. Yang, X. X. Huang. A Nonlinear Lagrangian Approach to Constrained Optimization Problems
1145 -- 1146Liqun Qi, Zengxin Wei. Corrigendum: On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods

Volume 11, Issue 3

573 -- 594Charles Audet, J. E. Dennis Jr.. Pattern Search Algorithms for Mixed Variable Programming
595 -- 610F. Sibel Salman, Joseph Cheriyan, R. Ravi, S. Subramanian. Approximating the Single-Sink Link-Installation Problem in Network Design
611 -- 646Marielba Rojas, Sandra A. Santos, Danny C. Sorensen. A New Matrix-Free Algorithm for the Large-Scale Trust-Region Subproblem
647 -- 674Mituhiro Fukuda, Masakazu Kojima, Kazuo Murota, Kazuhide Nakata. Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
675 -- 690Fabián Flores Bazán. Existence Theorems for Generalized Noncoercive Equilibrium Problems: The Quasi-Convex Case
691 -- 715Calvin A. Johnson, Ariela Sofer. A Primal-Dual Method for Large-Scale Image Reconstruction in Emission Tomography
716 -- 747R. W. H. Sargent, M. Ding. A New SQP Algorithm for Large-Scale Nonlinear Programming
748 -- 760G. Ravindran, M. Seetharama Gowda. Regularization of P[sub 0]-Functions in Box Variational Inequality Problems
761 -- 780Layne T. Watson. Theory of Globally Convergent Probability-One Homotopies for Nonlinear Programming
781 -- 795Ileana Castillo, Earl R. Barnes. Chaotic Behavior of the Affine Scaling Algorithm for Linear Programming
796 -- 817Jean B. Lasserre. Global Optimization with Polynomials and the Problem of Moments
818 -- 836Manuel A. Nunez, Robert M. Freund. Condition-Measure Bounds on the Behavior of the Central Trajectory of a Semidefinite Program
837 -- 857Edward J. Anderson, Michael C. Ferris. A Direct Search Algorithm for Optimization with Noisy Function Evaluations

Volume 11, Issue 2

289 -- 307Mark Fielding. Simulated Annealing With An Optimal Fixed Temperature
308 -- 319Alberto Caprara, Hans Kellerer, Ulrich Pferschy. The Multiple Subset Sum Problem
320 -- 340Tibor Illés, Jiming Peng, Cornelis Roos, Tamás Terlaky. A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for P::*(kappa):: Linear Complementarity Problems
341 -- 363Xiaojun Chen, Yinyu Ye. On Smoothing Methods for the P[sub 0] Matrix Linear Complementarity Problem
364 -- 379Nobuo Yamashita, Masao Fukushima. The Proximal Point Algorithm with Genuine Superlinear Convergence for the Monotone Complementarity Problem
380 -- 388Erling D. Andersen. On Primal and Dual Infeasibility Certificates in a Homogeneous Model for Convex Optimization
389 -- 410Liqun Qi, Guanglu Zhou. A Smoothing Newton Method for Minimizing a Sum of Euclidean Norms
411 -- 425Jean-Pierre Dedieu. Approximate Solutions of Analytic Inequality Systems
426 -- 443Zsolt Páles, Vera Zeidan. Optimum Problems with Measurable Set-Valued Constraints
444 -- 463Michael Jünger, Volker Kaibel. On the SQAP-Polytope
464 -- 494Hoang Tuy. Monotonic Optimization: Problems and Solution Approaches
495 -- 521Maïtine Bergounioux, Mounir Haddou, Michael Hintermüller, Karl Kunisch. A Comparison of a Moreau-Yosida-Based Active Set Strategy and Interior Point Methods for Constrained Optimal Control Problems
522 -- 546Peter Gritzmann, Sven de Vries, Markus Wiegelmann. Approximating Binary Images from Discrete X-Rays
547 -- 571Robert Mifflin, Claudia A. Sagastizábal. On VU-theory for Functions with Primal-Dual Gradient Structure

Volume 11, Issue 1

1 -- 30Thomas Lengauer, Martin Lügering. Provably Good Global Routing of Integrated Circuits
31 -- 52Wu Li, Chandal Nahak, Ivan Singer. Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
53 -- 69Luc Moreau, Dirk Aeyels. Optimization of Discontinuous Functions: A Generalized Theory of Differentiation
70 -- 86Alexander Shapiro, Tito Homem-de-Mello. On the Rate of Convergence of Optimal Solutions of Monte Carlo Approximations of Stochastic Programs
87 -- 112Darinka Dentcheva, Werner Römisch. Differential Stability of Two-Stage Stochastic Programs
113 -- 132Houduo Qi, Liqun Qi. A New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm For Inequality Constrained Optimization
149 -- 159R. De Leone, D. Pretolani. Auction Algorithms for Shortest Hyperpath Problems
160 -- 178A. B. Levy. Calm Minima in Parameterized Finite-Dimensional Optimization
179 -- 188Amir Beck, Marc Teboulle. Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
189 -- 198Alexander J. Zaslavski. On a Generic Existence Result in Optimization
199 -- 222Paul Armand, Jean Charles Gilbert, Sophie Jan-Jégou. A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems
223 -- 242Kim-Chuan Toh. Some New Search Directions for Primal-Dual Interior Point Methods in Semidefinite Programming
243 -- 253Kurt M. Anstreicher, Margaret H. Wright. A Note on the Augmented Hessian When the Reduced Hessian is Semidefinite
254 -- 265Kurt M. Anstreicher. Eigenvalue Bounds Versus Semidefinite Relaxations for the Quadratic Assignment Problem
266 -- 288Jean-Louis Goffin, Jean-Philippe Vial. Multiple Cuts in the Analytic Center Cutting Plane Method