SIAM Journal on Optimization, Volume 11

Volume 11, Number 1, 2000

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

Volume 11, Number 2, 2000

• Mark Fielding:
  Simulated Annealing With An Optimal Fixed Temperature. 289-307
  
• Alberto Caprara, Hans Kellerer, Ulrich Pferschy:
  The Multiple Subset Sum Problem. 308-319
  
• Tibor 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. 320-340
  
• Xiaojun Chen, Yinyu Ye:
  On Smoothing Methods for the P[sub 0] Matrix Linear Complementarity Problem. 341-363
  
• Nobuo Yamashita, Masao Fukushima:
  The Proximal Point Algorithm with Genuine Superlinear Convergence for the Monotone Complementarity Problem. 364-379
  
• Erling D. Andersen:
  On Primal and Dual Infeasibility Certificates in a Homogeneous Model for Convex Optimization. 380-388
  
• Liqun Qi, Guanglu Zhou:
  A Smoothing Newton Method for Minimizing a Sum of Euclidean Norms. 389-410
  
• Jean-Pierre Dedieu:
  Approximate Solutions of Analytic Inequality Systems. 411-425
  
• Zsolt Páles, Vera Zeidan:
  Optimum Problems with Measurable Set-Valued Constraints. 426-443
  
• Michael Jünger, Volker Kaibel:
  On the SQAP-Polytope. 444-463
  
• Hoang Tuy:
  Monotonic Optimization: Problems and Solution Approaches. 464-494
  
• Maï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. 495-521
  
• Peter Gritzmann, Sven de Vries, Markus Wiegelmann:
  Approximating Binary Images from Discrete X-Rays. 522-546
  
• Robert Mifflin, Claudia A. Sagastizábal:
  On VU-theory for Functions with Primal-Dual Gradient Structure. 547-571
  

Volume 11, Number 3, 2001

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

Volume 11, Number 4, 2001

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

Last update Wed May 22 18:17:49 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page