default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Optimization, Volume 8
Volume 8, Number 1, 1998
- María D. González-Lima, Richard A. Tapia, Florian A. Potra:
On Effectively Computing the Analytic Center of the Solution Set by Primal-Dual Interior-Point Methods. 1-25 - Renato D. C. Monteiro, Takashi Tsuchiya:
Global Convergence of the Affine Scaling Algorithm for Convex Quadratic Programming. 26-58 - Zhi-Quan Luo, Jos F. Sturm, Shuzhong Zhang:
Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming. 59-81 - Dominikus Noll:
Reconstruction with Noisy Data: An Approach via Eigenvalue Optimization. 82-104 - Stefano Lucidi
, Laura Palagi, Massimo Roma:
On Some Properties of Quadratic Programs with a Convex Quadratic Constraint. 105-122 - Jie Sun, Gongyun Zhao:
Global Linear and Local Quadratic Convergence of a Long-Step Adaptive-Mode Interior Point Method for Some Monotone Variational Inequality Problems. 123-139 - Houyuan Jiang, Masao Fukushima, Liqun Qi, Defeng Sun:
A Trust Region Method for Solving Generalized Complementarity Problems. 140-157 - Francisco Facchinei, Joaquim Júdice, João Soares:
An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints. 158-186 - Michael V. Solodov:
On the Convergence of Constrained Parallel Variable Distribution Algorithms. 187-196 - Regina Sandra Burachik, Alfredo N. Iusem:
A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space. 197-216 - Pierre L'Ecuyer, Gang George Yin:
Budget-Dependent Convergence Rate of Stochastic Approximation. 217-247 - Yves Pochet, Robert Weismantel:
The Sequential Knapsack Polytope. 248-264 - Berç Rustem, Quoc Nguyen:
An Algorithm for the Inequality-Constrained Discrete Min-Max Problem. 265-283 - Jian L. Zhou, André L. Tits:
Erratum: An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions. 284-285
Volume 8, Number 2, 1998
- R. A. Poliquin, R. Tyrrell Rockafellar:
Tilt Stability of a Local Minimum. 287-299 - Jonathan M. Borwein, Warren B. Moors:
A Chain Rule for Essentially Smooth Lipschitz Functions. 300-308 - Jonathan M. Borwein, Warren B. Moors:
Null Sets and Essentially Smooth Lipschitz Functions. 309-323 - Yurii E. Nesterov, Michael J. Todd:
Primal-Dual Interior-Point Methods for Self-Scaled Cones. 324-364 - Yin Zhang:
On Extending Some Primal-Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming. 365-386 - Masayuki Shida, Susumu Shindoh, Masakazu Kojima:
Existence and Uniqueness of Search Directions in Interior-Point Algorithms for the SDP and the Monotone SDLCP. 387-396 - Gongyun Zhao:
Interior Point Algorithms For Linear Complementarity Problems Based On Large Neighborhoods Of The Central Path. 397-413 - Anders Klarbring, Jong-Shi Pang:
Existence of Solutions to Discrete Semicoercive Frictional Contact Problems. 414-442 - Chih-Jen Lin, Shu-Cherng Fang, Soon-Yi Wu:
An Unconstrained Convex Programming Approach to Linear Semi-Infinite Programming. 443-456 - Wu Li, John Swetits:
The Linear l1 Estimator and the Huber M-Estimator. 457-475 - Pham Dinh Tao, Le Thi Hoai An:
A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem. 476-505 - Paul Tseng:
An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule. 506-531 - Radoslaw Pytlak:
An Efficient Algorithm for Large-Scale Nonlinear Programming Problems with Simple Bounds on the Variables. 532-560 - Michael Patriksson:
Cost Approximation: A Unified Framework of Descent Algorithms for Nonlinear Programs. 561-582 - Robert Mifflin, Defeng Sun, Liqun Qi:
Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization. 583-603 - Roger Fletcher, Sven Leyffer:
Numerical Experience with Lower Bounds for MIQP Branch-And-Bound. 604-616 - T. C. Edwin Cheng, Adam Janiak, Mikhail Y. Kovalyov:
Bicriterion Single Machine Scheduling with Resource Dependent Processing Times. 617-630
Volume 8, Number 3, 1998
- Indraneel Das, John E. Dennis:
Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems. 631-657 - Masao Fukushima:
Parallel Variable Transformation in Unconstrained Optimization. 658-672 - Masao Fukushima, Jong-Shi Pang:
Some Feasibility Issues in Mathematical Programs with Equilibrium Constraints. 673-681 - Marucha Lalee, Jorge Nocedal, Todd D. Plantenga:
On the Implementation of an Algorithm for Large-Scale Equality Constrained Optimization. 682-706 - Zsolt Páles, Vera Zeidan:
Optimum Problems with Certain Lower Semicontinuous Set-Valued Constraints. 707-727 - J. Sun, H. Kuo:
Applying a Newton Method to Strictly Convex Separable Network Quadratic Programs. 728-745 - Farid Alizadeh, Jean-Pierre A. Haeberly, Michael L. Overton:
Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results. 746-768 - Michael J. Todd, Kim-Chuan Toh, Reha H. Tütüncü:
On the Nesterov-Todd Direction in Semidefinite Programming. 769-796 - Renato D. C. Monteiro:
Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions. 797-812 - Lixing Han, Guanghui Liu:
Global Analysis of the Dennis-Wolkowicz Least-Change Secant Algorithm. 813-832 - Stephen G. Nash, Ariela Sofer:
On the Complexity of a Practical Interior-Point Method. 833-849 - Francisco Facchinei, Andreas Fischer, Christian Kanzow:
Regularity Properties of a Semismooth Reformulation of Variational Inequalities. 850-869
Volume 8, Number 4, 1998
- Donald Goldfarb, Katya Scheinberg:
Interior Point Trajectories in Semidefinite Programming. 871-886 - C. Kirjner-Neto, Elijah Polak:
On the Conversion of Optimization Problems with Max-Min Constraints to Standard Optimization Problems. 887-915 - Stefano Lucidi, Francesco Rochetich, Massimo Roma:
Curvilinear Stabilization Techniques for Truncated Newton Methods in Large Scale Unconstrained Optimization. 916-939 - J. Frédéric Bonnans, Alexander Shapiro:
Nondegeneracy and Quantitative Stability of Parameterized Optimization Problems with Multiple Solutions. 940-946 - Richard D. McBride:
Progress Made in Solving the Multicommodity Flow Problem. 947-955 - Eithan Schweitzer:
An Interior Random Vector Algorithm for MultiStage Stochastic Linear Programs. 956-972 - Onésimo Hernández-Lerma, Jean B. Lasserre:
Approximation Schemes for Infinite Linear Programs. 973-988 - Abderrahmane Habbal:
Nonsmooth Shape Optimization Applied to Linear Acoustics. 989-1006 - Florian A. Potra, Rongqin Sheng:
A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming. 1007-1028 - Bernard Lemaire:
Duality in Reverse Convex Optimization. 1029-1037 - Roger Fletcher:
A New Degeneracy Method and Steepest-Edge-Based Conditioning for LP. 1038-1059 - Tamara G. Kolda, Dianne P. O'Leary, Larry Nazareth:
BFGS with Update Skipping and Varying Memory. 1060-1083 - Florian Jarre, Michal Kocvara, Jochem Zowe:
Optimal Truss Design by Interior-Point Methods. 1084-1107 - Faranak Sharifi Mokhtarian, Jean-Louis Goffin:
A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems. 1108-1131 - Anders Forsgren, Philip E. Gill:
Primal-Dual Interior Methods for Nonconvex Nonlinear Programming. 1132-1152
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-12-19 22:13 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:
