default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Optimization, Volume 16
Volume 16, Number 1, 2005
- Andreas Wächter, Lorenz T. Biegler
:
Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence. 1-31 - Andreas Wächter, Lorenz T. Biegler:
Line Search Filter Methods for Nonlinear Programming: Local Convergence. 32-48 - Ping-Qi Pan:
A Revised Dual Projective Pivot Algorithm for Linear Programming. 49-68 - Andreas Eichhorn, Werner Römisch:
Polyhedral Risk Measures in Stochastic Programming. 69-95 - Diethard Klatte, Bernd Kummer:
Strong Lipschitz Stability of Stationary Solutions for Nonlinear Programs and Variational Inequalities. 96-119 - Mihai Anitescu:
Global Convergence of an Elastic Mode Approach for a Class of Mathematical Programs with Complementarity Constraints. 120-145 - Claudia A. Sagastizábal, Mikhail V. Solodov:
An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter. 146-169 - William W. Hager, Hongchao Zhang:
A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search. 170-192 - Mihály Csaba Markót, Tibor Csendes:
A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems. 193-219 - Gerhard Reinelt, Dirk Oliver Theis:
Transformation of Facets of the General Routing Problem Polytope. 220-234 - Yurii E. Nesterov:
Excessive Gap Technique in Nonsmooth Convex Minimization. 235-249 - Alexander J. Zaslavski:
A Sufficient Condition for Exact Penalty in Constrained Optimization. 250-262 - Charles Fortin:
Computing the Local-Nonglobal Minimizer of a Large Scale Trust-Region Subproblem. 263-296 - M. Marshall:
Error Estimates in the Optimization of Degree Two Polynomials on a Discrete Hypercube. 297-309
Volume 16, Number 2, 2005
- Chong Li, Kung Fu Ng:
Strong CHIP for Infinite System of Closed Convex Sets in Normed Linear Spaces. 311-340 - Nick I. M. Gould, Caroline Sainvitu, Philippe L. Toint:
A Filter-Trust-Region Method for Unconstrained Optimization. 341-357 - Didier Aussel, Nicolas Hadjisavvas:
Adjusted Sublevel Sets, Normal Operator, and Quasi-convex Programming. 358-367 - Thomas Lachand-Robert, Édouard Oudet:
Minimizing within Convex Bodies Using a Convex Hull Method. 368-379 - Kevin K. H. Cheung:
On Lov[a-acute]sz--Schrijver Lift-and-Project Procedures on the Dantzig--Fulkerson--Johnson Relaxation of the TSP. 380-399 - Wenbao Ai, Shuzhong Zhang:
An O(\sqrtn L) Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP. 400-417 - R. Baker Kearfott, Siriporn Hongthong:
Validated Linear Relaxations and Preprocessing: Some Experiments. 418-433 - Domenico Cantone, Gianluca Cincotti, Alfredo Ferro, Alfredo Pulvirenti:
An Efficient Approximate Algorithm for the 1-Median Problem in Metric Spaces. 434-451 - Toshihiro Matsumoto:
An Algebraic Condition Equivalent to Strong Stability of Stationary Solutions of Nonlinear Positive Semidefinite Programs. 452-470 - Richard H. Byrd, Nicholas I. M. Gould, Jorge Nocedal, Richard A. Waltz:
On the Convergence of Successive Linear-Quadratic Programming Algorithms. 471-489 - Dorina Jibetean, Monique Laurent:
Semidefinite Approximations for Global Unconstrained Polynomial Optimization. 490-514 - Mark A. Abramson:
Second-Order Behavior of Pattern Search. 515-530 - Pierre-Antoine Absil, Robert E. Mahony, Ben Andrews:
Convergence of the Iterates of Descent Methods for Analytic Cost Functions. 531-547 - Jérome M. B. Walmag, Éric J. M. Delhez:
A Note on Trust-Region Radius Update. 548-562 - Tamara G. Kolda:
Revisiting Asynchronous Parallel Pattern Search for Nonlinear Optimization. 563-586 - Victor DeMiguel, Michael P. Friedlander, Francisco J. Nogales, Stefan Scholtes:
A two-sided relaxation scheme for Mathematical Programs with Equilibrium Constraints. 587-609 - Jean B. Lasserre:
Sum of Squares Approximation of Polynomials, Nonnegative on a Real Algebraic Set. 610-628
Volume 16, Number 3, 2006
- María J. Cánovas, Marco A. López, Juan Parra, F. Javier Toledo:
Distance to Solvability/Unsolvability in Linear Optimization. 629-649 - Elijah Polak, Michael Wetter:
Precision Control for Generalized Pattern Search Algorithms with Adaptive Precision Function Evaluations. 650-669 - Huifu Xu:
An Implicit Programming Approach for a Class of Stochastic Mathematical Programs with Complementarity Constraints. 670-696 - Alfred Auslender, Marc Teboulle:
Interior Gradient and Proximal Methods for Convex and Conic Optimization. 697-725 - Samuel Burer, Dieter Vandenbussche:
Solving Lift-and-Project Relaxations of Binary Integer Programs. 726-750 - Jean B. Lasserre:
A Sum of Squares Approximation of Nonnegative Polynomials. 751-765 - Dimitri P. Bertsekas, Asuman E. Ozdaglar, Paul Tseng:
Enhanced Fritz John Conditions for Convex Programming. 766-797 - Qiya Hu, Jun Zou:
Nonlinear Inexact Uzawa Algorithms for Linear and Nonlinear Saddle-point Problems. 798-825 - Giuseppe M. Buttazzo, Aldo Pratelli, Eugene Stepanov:
Optimal Pricing Policies for Public Transportation Networks. 826-853 - Gerard van der Laan, Dolf Talman, Zaifu Yang:
Refinements of Stationary Points with Applications to Noncooperative Games and Economics. 854-870 - Shuzhong Zhang, Yongwei Huang:
Complex Quadratic Optimization and Semidefinite Programming. 871-890 - Elizabeth D. Dolan, Jorge J. Moré, Todd S. Munson:
Optimality Measures for Performance Profiles. 891-909 - Yaroslav D. Sergeyev, Dmitri E. Kvasov:
Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants. 910-937
Volume 16, Number 4, 2006
- Tae Roh, Lieven Vandenberghe:
Discrete Transforms, Semidefinite Programming, and Sum-of-Squares Representations of Nonnegative Polynomials. 939-964 - Jorge R. Vera, Iván Derpich:
Incorporating Condition Measures in the Context of Combinatorial Optimization. 965-985 - Yu-Hong Dai:
Fast Algorithms for Projection on an Ellipsoid. 986-1006 - Krzysztof C. Kiwiel:
A Proximal Bundle Method with Approximate Subgradient Linearizations. 1007-1023 - Alfred Müller, Marco Scarsini:
Stochastic Order Relations and Lattices of Probability Measures. 1024-1043 - Harald Günzel, Francisco Guerra Vázquez, Hubertus Th. Jongen:
Critical Value Functions have Finite Modulus of Concavity. 1044-1053 - Giampaolo Liuzzi, Stefano Lucidi, Marco Sciandrone:
A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems. 1054-1075 - Luis Fernando Zuluaga, Juan Carlos Vera, Javier Peña:
LMI Approximations for Cones of Positive Semidefinite Forms. 1076-1091 - Chek Beng Chua:
A New Notion of Weighted Centers for Semidefinite Programming. 1092-1109 - Cornelis Roos:
A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization. 1110-1136 - Qin Ni, Chen Ling, Liqun Qi, Kok Lay Teo:
A Truncated Projected Newton-Type Algorithm for Large-Scale Semi-infinite Programming. 1137-1154 - Armin Fügenschuh, Michael Herty, Axel Klar, Alexander Martin:
Combinatorial and Continuous Models for the Optimization of Traffic Flows on Networks. 1155-1176 - Michael Hintermüller, Michael Hinze:
A SQP-Semismooth Newton-type Algorithm applied to Control of the instationary Navier--Stokes System Subject to Control Constraints. 1177-1200 - Moritz Diehl, Florian Jarre, Christoph H. Vogelbusch:
Loss of Superlinear Convergence for an SQP-Type Method with Conic Constraints. 1201-1210 - Bharath Kumar Rangarajan:
Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones. 1211-1229 - Natalia Nadezhkina, Wataru Takahashi:
Strong Convergence Theorem by a Hybrid Method for Nonexpansive Mappings and Lipschitz-Continuous Monotone Mappings. 1230-1241
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-10-21 20:19 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:
