default search action
SIAM Journal on Optimization, Volume 6
Volume 6, Number 1, 1996
- Renato D. C. Monteiro, Stephen J. Wright:
A Superlinear Infeasible-Interior-Point Affine Scaling Algorithm for LCP. 1-18 - Florian A. Potra:
An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming. 19-32 - Kurt M. Anstreicher:
On Long Step Path Following and SUMT for Linear and Quadratic Programming. 33-46 - Richard A. Tapia, Yin Zhang, Matthew J. Saltzman, Alan Weiser:
The Mehrotra Predictor-Corrector Interior-Point Method As a Perturbed Composite Newton Method. 47-56 - Gongyun Zhao:
On the Relationship Between the Curvature Integral and the Complexity of Path-Following Methods in Linear Programming. 57-73 - Knud D. Andersen:
An Efficient Newton Barrier Method for Minimizing a Sum of Euclidean Norms. 74-95 - Kazufumi Ito, Karl Kunisch:
Augmented Lagrangian-SQP-Methods in Hilbert Spaces and Application to Control in the Coefficients Problems. 96-125 - F.-S. Kupfer:
An Infinite-Dimensional Convergence Theory for Reduced SQP Methods in Hilbert Space. 126-163 - Adrian S. Lewis:
Convex Analysis on the Hermitian Matrices. 164-177 - Simon Di:
Classical Optimality Conditions under Weaker Assumptions. 178-197 - D. E. Ward:
Dini Derivatives of the Marginal Function of a Non-Lipschitzian Program. 198-211 - Phan Thien Thach, Masakazu Kojima:
A Generalized Convexity and Variational Inequality for Quasi-Convex Minimization. 212-226 - Krzysztof C. Kiwiel:
Restricted Step and Levenberg-Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization. 227-249 - Dorit S. Hochbaum, Sung-Pil Hong:
On the Complexity of the Production-Transportation Problem. 250-264
Volume 6, Number 2, 1996
- James V. Burke, Paul Tseng:
A Unified Analysis of Hoffman's Bound via Fenchel Duality. 265-282 - Aaron Melman
:
A Linesearch Procedure in Barrier Methods for Some Convex Programming Problems. 283-298 - Wu Li:
Differentiable Piecewise Quadratic Exact Penalty Functions for Quadratic Programs with Simple Bound Constraints. 299-315 - Stephen C. Billups
Convergence of an Infeasible Interior-Point Algorithm from Arbitrary Positive Starting Points. 316-325 - Christian Kanzow:
Global Convergence Properties of Some Iterative Methods for Linear Complementarity Problems. 326-341 - Christoph Helmberg, Franz Rendl, Robert J. Vanderbei, Henry Wolkowicz:
An Interior-Point Method for Semidefinite Programming. 342-361 - Bevil Milton Glover, Y. Ishizuka, Vaithilingam Jeyakumar
Complete Characterizations of Global Optimality for Problems Involving the Pointwise Minimum of Sublinear Functions. 362-372 - Matthias Heinkenschloss
Projected Sequential Quadratic Programming Methods. 373-417 - Thomas F. Coleman, Yuying Li:
An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds. 418-445 - Paul Tseng, Nobuo Yamashita, Masao Fukushima:
Equivalence of Complementarity Problems to Differentiable Minimization: A Unified Approach. 446-460 - Jian L. Zhou, André L. Tits:
An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions. 461-487 - Daniel Ralph:
A Parallel Method for Unconstrained Discrete-Time Optimal Control Problems. 488-512 - Sigrún Andradóttir:
A Global Search Method for Discrete Stochastic Optimization. 513-530 - Werner Römisch, Rüdiger Schultz:
Lipschitz Stability for Stochastic Programs with Complete Recourse. 531-547
Volume 6, Number 3, 1996
- Jorge R. Vera:
Ill-Posedness and the Complexity of Deciding Existence of Solutions to Linear Programs. 549-569 - Pi-Fang Hung, Yinyu Ye:
An Asymptotical O(√(n) L)-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods. 570-586 - Jianming Miao:
Two Infeasible Interior-Point Predictor-Corrector Algorithms for Linear Programming. 587-599 - Kaj Madsen, Hans Bruun Nielsen, Mustafa Ç. Pinar:
A New Finite Continuation Algorithm for Linear Programming. 600-616 - Aharon Ben-Tal, Marc Teboulle:
A Conjugate Duality Scheme Generating a New Class of Differentiable Duals. 617-625 - Ciyou Zhu:
Asymptotic Convergence Analysis of Some Inexact Proximal Point Algorithms for Minimization. 626-637 - Jean-Louis Goffin, Zhi-Quan Luo, Yinyu Ye:
Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems. 638-652 - Dan Feng, Robert B. Schnabel:
Tensor Methods for Equality Constrained Optimization. 653-673 - Andrew R. Conn, Nicholas I. M. Gould
Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints. 674-703 - Kouichi Taji, Masao Fukushima:
A New Merit Function and a Successive Quadratic Programming Algorithm for Variational Inequality Problems. 704-713 - Daoli Zhu, Patrice Marcotte:
Co-Coercivity and Its Role in the Convergence of Iterative Schemes for Solving Variational Inequalities. 714-726 - Wolfgang M. Hartmann, Robert E. Hartwig:
Computing the Moore-Penrose Inverse for the Covariance Matrix in Constrained Nonlinear Estimation. 727-747 - Zhijun Wu:
The Effective Energy Transformation Scheme as a Special Continuation Approach to Global Optimization with Application to Molecular Conformation. 748-768 - Hédy Attouch:
Viscosity Solutions of Minimization Problems. 769-806 - Dimitri P. Bertsekas:
Incremental Least Squares Methods and the Extended Kalman Filter. 807-822 - Francisco Barahona:
Network Design Using Cut Inequalities. 823-837 - Jianzhong Zhang, Detong Zhu:
A Bilevel Programming Method for Pipe Network Optimization. 838-857 - Carlos E. Ferreira, Alexander Martin
Solving Multiple Knapsack Problems by Cutting Planes. 858-877
Volume 6, Number 4, 1996
- James Renegar:
Condition Numbers, the Barrier Method, and the Conjugate-Gradient Method. 879-912 - Michael D. Grigoriadis, Leonid G. Khachiyan:
An Interior Point Method for Bordered Block-Diagonal Linear Programs. 913-932 - Aiping Liao, Michael J. Todd:
Solving LP Problems via Weighted Centers. 933-960 - Robert Entriken:
Parallel Decomposition: Results for Staircase Linear Programs. 961-977 - Kevin A. McShane:
On the Superlinear Convergence of an O(n3 L) Interior-Point Algorithm for the Monotone LCP. 978-993 - S. R. Mohan, S. K. Neogy:
Algorithms for the Generalized Linear Complementarity Problem with a Vertical Block Z-Matrix. 994-1006 - Leonid Faybusovich:
Semidefinite Programming: A Path-Following Algorithm for a Linear-Quadratic Functional. 1007-1024 - Richard H. Byrd, Humaid Khalfan, Robert B. Schnabel:
Analysis of a Symmetric Rank-One Trust Region Method. 1025-1039 - Thomas F. Coleman, Yuying Li:
A Reflective Newton Method for Minimizing a Quadratic Function Subject to Bounds on Some of the Variables. 1040-1058 - Andrew R. Conn, Nick I. M. Gould
Convergence Properties of Minimization Algorithms for Convex Constraints Using a Structured Trust Region. 1059-1086 - Asen L. Dontchev
Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex Sets. 1087-1105 - Masao Fukushima, Liqun Qi:
A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization. 1106-1120 - R. A. Poliquin, R. Tyrrell Rockafellar
Generalized Hessian Properties of Regularized Nonsmooth Functions. 1121-1137 - Rüdiger Schultz:
Rates of Convergence in Stochastic Programs with Complete Integer Recourse. 1138-1152 - Endre Boros
Optimality of Nested Partitions and Its Application to Cluster Analysis. 1153-1162
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-11-22 19:34 CET 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: