default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Optimization, Volume 3
Volume 3, Number 1, 1993
- Humaid Khalfan, Richard H. Byrd, Robert B. Schnabel:
A Theoretical and Experimental Study of the Symmetric Rank-One Update. 1-24 - Norbert Ascheuer, Laureano F. Escudero, Martin Grötschel, Mechthild Stoer:
A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing). 25-42 - Zhi-Quan Luo, Paul Tseng:
Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set. 43-59 - Stephen A. Vavasis:
Black-Box Complexity of Local Minimization. 60-80 - Matthias Heinkenschloss
:
Mesh Independence for Nonlinear Least Squares Problems with Norm Constraints. 81-117 - Yin Zhang, Richard A. Tapia:
A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programming. 118-133 - Bruce N. Lundberg, Aubrey B. Poore:
Numerical Continuation and Singularity Detection Methods for Parametric Nonlinear Programming. 134-154 - Wu Li:
Remarks on Convergence of the Matrix Splitting Algorithm for the Symmetric Linear Complementarity Problem. 155-163 - Andrew R. Conn, Nick I. M. Gould, Annick Sartenaer, Philippe L. Toint:
Global Convergence of a Class of Trust Region Algorithms for Optimization Using Inexact Projections on Convex Constraints. 164-221
Volume 3, Number 2, 1993
- Kaj Madsen, Hans Bruun Nielsen:
A Finite Smoothing Algorithm for Linear l1 Estimation. 223-235 - Lakshman S. Thakur:
Uniformly Extremal Solutions in Sobolev Function Spaces for the Quadratic Case: Characterization and Applications. 236-247 - Jonathan M. Borwein, Adrian S. Lewis:
Partially-Finite Programming in L1 and the Existence of Maximum Entropy Estimates. 248-267 - Dimitri P. Bertsekas, David A. Castañón, Haralampos Tsaknakis:
Reverse Auction and the Solution of Inequality Constrained Assignment Problems. 268-297 - Thomas F. Coleman, Laurie A. Hulbert:
A Globally and Superlinearly Convergent Algorithm for Convex Quadratic Programs with Simple Bbounds. 298-321 - Aharon Ben-Tal, Martin P. Bendsøe:
A New Method for Optimal Truss Topology Design. 322-358 - Hédy Attouch, Roger J.-B. Wets:
Quantitative Stability of Variational Systems II. A Framework for Nonlinear Conditioning. 359-381 - Donald Goldfarb, Siyun Wang:
Partial-Update Newton Methods for Unary, Factorable, and Partially Separable Optimization. 382-397 - Masakazu Kojima, Yoshifumi Kurita, Shinji Mizuno:
Large-Step Interior Point Algorithms for Linear Complementarity Problems. 398-412 - Yin Zhang, Richard A. Tapia, Florian A. Potra:
On the Superlinear Convergence of Interior-Point Algorithms for a General Class of Problems. 413-422 - Carl T. Kelley, Ekkehard W. Sachs:
Pointwise Broyden Methods. 423-441
Volume 3, Number 3, 1993
- Jong-Shi Pang, Liqun Qi:
Nonsmooth Equations: Motivation and Algorithms. 443-465 - Wu Li, John Swetits:
A Newton Method for Convex Regression, Data Smoothing, and Quadratic Programming with Bounded Constraints. 466-488 - J. C. Dunn:
Second-Order Multiplier Update Calculations for Optimal Control Problems and Related Large Scale Nonlinear Programs. 489-502 - Bintong Chen, Patrick T. Harker:
A Noninterior Continuation Method for Quadratic and Linear Programming. 503-515 - Mauricio G. C. Resende, Geraldo Veiga:
An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks. 516-537 - Gong Chen, Marc Teboulle:
Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions. 538-543 - Aubrey B. Poore, Nenad Rijavec:
A Lagrangian Relaxation Algorithm for Multidimensional Assignment Problems Arising from Multitarget Tracking. 544-563 - Ryuichi Hirabayashi, Masayuki Shida, Susumu Shindoh:
Manifold Structure of the Karush-Kuhn-Tucker Stationary Solution Set with Two Parameters. 564-581 - X. Zou, Ionel Michael Navon, M. Berger, Paul Kang-Hoh Phua, Tamar Schlick, François-Xavier Le Dimet:
Numerical Experience with Limited-Memory Quasi-Newton and Truncated Newton Methods. 582-608 - Yuying Li:
A Globally Convergent Method for lp Problems. 609-629 - Jeffrey C. Lagarias:
A Collinear Scaling Interpretation of Karmarkar's Linear Programming Algorithm. 630-636 - Marucha Lalee, Jorge Nocedal:
Automatic Column Scaling Strategies for Quasi-Newton Methods. 637-653 - Joanna Rakowska, Raphael T. Haftka, Layne T. Watson:
Multi-Objective Control-Structure Optimization via Homotopy Methods. 654-667
Volume 3, Number 4, 1993
- Alfred Auslender, Roberto Cominetti, Jean-Pierre Crouzeix:
Convex Functions with Unbounded Level Sets and Applications to Duality Theory. 669-687 - Francisco Barahona:
Reducing Matching to Polynomial Size Linear Programming. 688-695 - Tamra J. Carpenter, Irvin J. Lustig, John M. Mulvey, David F. Shanno:
Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives. 696-725 - Yasufumi Saruwatari, Tomomi Matsui:
A Note on K-Best Solutions to the Chinese Postman Problem. 726-733 - E. Andrew Boyd:
Generating Fenchel Cutting Planes for Knapsack Polyhedra. 734-750 - Ciyou Zhu, R. Tyrrell Rockafellar:
Primal-Dual Projected Gradient Algorithms for Extended Linear-Quadratic Programming. 751-783 - Chuangyin Dang:
The D2*-Triangulation for Continuous Deformation Algorithms to Compute Solutions of Nonlinear Equations. 784-799 - J. E. Martínez-Legaz, S. Romano-Rodríguez:
α-Lower Subdifferentiable Functions. 800-825 - Immanuel M. Bomze, Gabriele Danninger:
A Global Optimization Algorithm for Concave Quadratic Programming Problems. 826-842 - Florian A. Potra, Yinyu Ye:
A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems. 843-860 - Robert A. Bosch:
On Mizuno's Rank-One Updating Algorithm for Linear Programming. 861-867 - Bernard Delyon, Anatoli B. Juditsky:
Accelerated Stochastic Approximation. 868-881 - Ubaldo Garco:
Parallel Projected Aggregation Methods for Solving the Convex Feasibility Problem. 882-900 - Kenneth O. Kortanek, Hoon No:
A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems. 901-918
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-08 20:20 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:
