Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Optimization, Volume 9
Volume 9, Number 1, 1998
- Moshe Doljansky, Marc Teboulle:
An Interior Proximal Algorithm and the Exponential Multiplier Method for Semidefinite Programming. 1-13 - Francisco Facchinei, Andreas Fischer, Christian Kanzow:
On the Accurate Identification of Active Constraints. 14-32 - Laurent El Ghaoui, François Oustry, Hervé Lebret
:
Robust Solutions to Uncertain Semidefinite Programs. 33-52 - Ian H. Dinwoodie:
Stochastic Simulation on Integer Constraint Sets. 53-61 - Kaj Madsen, Hans Bruun Nielsen, Mustafa Ç. Pinar:
A Finite Continuation Algorithm for Bound Constrained Quadratic Programming. 62-83 - Margaret H. Wright:
Ill-Conditioning and Computational Error in Interior Methods for Nonlinear Programming. 84-111 - Jeffrey C. Lagarias, James A. Reeds, Margaret H. Wright, Paul E. Wright:
Convergence Properties of the Nelder-Mead Simplex Method in Low Dimensions. 112-147 - K. I. M. McKinnon:
Convergence of the Nelder-Mead Simplex Method to a Nonstationary Point. 148-158 - Ross Geoghegan, Jeffrey C. Lagarias, Robert C. Melville:
Threading Homotopies and DC Operating Points of Nonlinear Circuits. 159-178 - Patrice Marcotte, Daoli Zhu:
Weak Sharp Solutions of Variational Inequalities. 179-189 - Kurt M. Anstreicher:
Towards a Practical Volumetric Cutting Plane Method for Convex Programming. 190-206 - Harvey J. Greenberg, Allen G. Holder, Kees Roos, Tamás Terlaky:
On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance. 207-216 - Zhi-Quan Luo, Jie Sun:
An Analytic Center Based Column Generation Algorithm for Convex Quadratic Feasibility Problems. 217-235 - Ralf Borndörfer, Carlos E. Ferreira, Alexander Martin:
Decomposing Matrices into Blocks. 236-269 - William E. Hart:
Sequential Stopping Rules for Random Optimization Methods with Applications to Multistart Local Search. 270-290
Volume 9, Number 2, 1999
- John E. Dennis Jr., Mahmoud El-Alem, Karen Williamson:
A Trust-Region Approach to Nonlinear Systems of Equalities and Inequalities. 291-315 - Mark S. Gockenbach, Anthony J. Kearsley:
Optimal Signal Sets for Non-Gaussian Detectors. 316-326 - T. D. Choi, Carl T. Kelley:
Estimates for the Nash-Sofer Preconditioner for the Reduced Hessian for Some Elliptic Variational Inequalities. 327-341 - Christian Kanzow, Heiko Pieper:
Jacobian Smoothing Methods for Nonlinear Complementarity Problems. 342-373 - Jane J. Ye:
Optimality Conditions for Optimization Problems with Complementarity Constraints. 374-387 - Defeng Sun, Robert S. Womersley:
A New Unconstrained Differentiable Merit Function for Box Constrained Variational Inequality Problems and a Damped Gauss-Newton Method. 388-413 - Christoph Stangl:
Optimal Sizing for a Class of Nonlinearly Elastic Materials. 414-443 - Masakazu Kojima, Masayuki Shida, Susumu Shindoh:
A Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Using the Alizadeh-Haeberly-Overton Search Direction. 444-465 - J. Frédéric Bonnans, Roberto Cominetti, Alexander Shapiro:
Second Order Optimality Conditions Based on Parabolic Second Order Tangent Sets. 466-492 - Geir Dahl:
Stable Set Polytopes for a Class of Circulant Graphs. 493-503 - Nicholas I. M. Gould, Stefano Lucidi, Massimo Roma, Philippe L. Toint:
Solving the Trust-Region Subproblem using the Lanczos Method. 504-525 - François Oustry:
The U-Lagrangian of the Maximum Eigenvalue Function. 526-549
Volume 9, Number 3, 1999
- Renato D. C. Monteiro, Takashi Tsuchiya:
Polynomial Convergence of a New Family of Primal-Dual Algorithms for Semidefinite Programming. 551-577 - Yuanfu Xie, Richard H. Byrd:
Practical Update Criteria for Reduced Hessian SQP: Global Analysis. 578-604 - Bintong Chen, Naihua Xiu:
A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen-Mangasarian Smoothing Functions. 605-623 - Bintong Chen, Xiaojun Chen:
A Global and Local Superlinear Continuation-Smoothing Method for P0 and R0 NCP or Monotone NCP. 624-645 - Jianzhong Zhang, Chengxian Xu:
A Class of Indefinite Dogleg Path Methods for Unconstrained Minimization. 646-667 - Krzysztof C. Kiwiel, Charles H. Rosa, Andrzej Ruszczynski:
Proximal Decomposition Via Alternating Linearization. 668-689 - Didier Aussel, Jean-Noël Corvellec, Marc Lassonde:
Nonsmooth Constrained Optimization and Multidirectional Mean Value Inequalities. 690-706 - Yurii E. Nesterov, Jean-Philippe Vial:
Homogeneous Analytic Center Cutting Plane Methods for Convex Problems and Variational Inequalities. 707-728 - Renato D. C. Monteiro, Jong-Shi Pang:
A Potential Reduction Newton Method for Constrained Equations. 729-754 - Paul T. Boggs, Anthony J. Kearsley, Jon W. Tolle:
A Practical Algorithm for General Large Scale Nonlinear Optimization Problems. 755-778 - Harry Cohn, Mark Fielding:
Simulated Annealing: Searching for an Optimal Temperature Schedule. 779-802
Volume 9, Number 4, 1999
- Kurt M. Anstreicher:
Linear Programming in O([n3/ln n]L) Operations. 803-812 - Aharon Ben-Tal, Michal Kocvara, Arkadi Nemirovski, Jochem Zowe:
Free Material Design via Semidefinite Programming: The Multiload Case with Contact Conditions. 813-832 - Paul T. Boggs, Anthony J. Kearsley, Jon W. Tolle:
A Global Convergence Analysis of an Algorithm for Large-Scale Nonlinear Optimization Problems. 833-862 - Nathan W. Brixius, Florian A. Potra, Rongqin Sheng:
Nonsymmetric Search Directions for Semidefinite Programming. 863-876 - Richard H. Byrd, Mary E. Hribar, Jorge Nocedal:
An Interior Point Algorithm for Large-Scale Nonlinear Programming. 877-900 - Hongwei Cheng, Vladimir Rokhlin, Norman Yarvin:
Nonlinear Optimization, Quadrature, and Interpolation. 901-923 - Andrew R. Conn, Luís Nunes Vicente, Chandu Visweswariah:
Two-Step Algorithms for Nonlinear Optimization with Structured Applications. 924-947 - Steven J. Cox, Paul X. Uhlig:
Where Best to Hold a Drum Fast. 948-964 - Mahmoud El-Alem:
A Global Convergence Theory for Dennis, El-Alem, and Maciel's Class of Trust-Region Algorithms for Constrained Optimization without Assuming Regularity. 965-990 - Michael C. Ferris, Robert Fourer, David M. Gay:
Expressing Complementarity Problems in an Algebraic Modeling Language and Communicating Them to Solvers. 991-1009 - Michael L. Overton, Robert B. Schnabel:
Dedication. - Sharon Filipowski:
On the Complexity of Solving Feasible Linear Programs Specified with Approximate Data. 1010-1040 - Nicholas Ian Mark Gould:
On Modified Factorizations for Large-Scale Linearly Constrained Optimization. 1041-1063 - Carl T. Kelley, Ekkehard W. Sachs:
A Trust Region Method for Parabolic Boundary Control Problems. 1064-1081 - Robert Michael Lewis, Virginia Torczon:
Pattern Search Algorithms for Bound Constrained Minimization. 1082-1099 - Chih-Jen Lin, Jorge J. Moré:
Newton's Method for Large Bound-Constrained Optimization Problems. 1100-1127 - Olvi L. Mangasarian:
Polyhedral Boundary Projection. 1128-1134 - Robert B. Schnabel, Elizabeth Eskow:
A Revised Modified Cholesky Factorization Algorithm. 1135-1148 - Maria Sosonkina, Donald C. S. Allison, Layne T. Watson:
Parallel Adaptive GMRES Implementations for Homotopy Methods. 1149-1158 - Stephen J. Wright:
Modified Cholesky Factorizations in Interior-Point Algorithms for Linear Programming. 1159-1191 - M. Zhu, John L. Nazareth, Henry Wolkowicz:
The Quasi-Cauchy Relation and Diagonal Updating. 1192-1204
a service of 
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.
last updated on 2024-04-22 20:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
