default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Optimization, Volume 13
Volume 13, Number 1, 2002
- Christian Kanzow, Christian Nagel:
Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results. 1-23 - Kung Fu Ng, Wei Hong Yang:
Error Bounds for Abstract Linear Inequality Systems. 24-43 - Roger Fletcher, Sven Leyffer
, Philippe L. Toint:
On the Global Convergence of a Filter--SQP Algorithm. 44-59 - Wlodzimierz Ogryczak, Andrzej Ruszczynski:
Dual Stochastic Dominance and Related Mean-Risk Models. 60-78 - Ubaldo M. García-Palomares, J. F. Rodríguez:
New Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization. 79-96 - Stefano Lucidi, Marco Sciandrone:
On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization. 97-116 - Antonio Frangioni:
Generalized Bundle Methods. 117-156 - Dorin Bucur, Giuseppe M. Buttazzo, Nicolas Varchon:
On the Problem of Optimal Cutting. 157-167 - Dinh The Luc:
A Multiplier Rule for Multiobjective Programming Problems with Continuous Data. 168-178 - Jiming Peng, Cornelis Roos, Tamás Terlaky:
Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities. 179-203 - Satoru Iwata, Maiko Shigeno:
Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization. 204-211 - Thierry Champion:
Tubularity and Asymptotic Convergence of Penalty Trajectories in Convex Programming. 212-227 - Chong Li, Xiao-Qing Jin:
Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification. 228-239 - Gang George Yin, R. H. Liu, Qing Zhang:
Recursive Algorithms for Stock Liquidation: A Stochastic Optimization Approach. 240-263 - Patricia D. Hough, Juan C. Meza:
A Class of Trust-Region Methods for Parallel Optimization. 264-282 - Yair Censor, Gabor T. Herman:
Block-Iterative Algorithms with Underrelaxed Bregman Projections. 283-297 - Anhua Lin, Shih-Ping Han:
On the Distance between Two Ellipsoids. 298-308
Volume 13, Number 2, 2002
- Kurt M. Anstreicher:
Improved Complexity for Maximum Volume Inscribed Ellipsoids. 309-320 - Karl Kunisch, Arnd Rösch:
Primal-Dual Active Set Strategy for a General Class of Constrained Optimal Control Problems. 321-334 - Rudolf Müller, Andreas S. Schulz:
Transitive Packing: A Unifying Concept in Combinatorial Optimization. 335-367 - Alexey F. Izmailov, Mikhail V. Solodov:
Complementarity Constraint Qualification via the Theory of 2-Regularity. 368-385 - Alexey F. Izmailov, Mikhail V. Solodov:
Superlinearly Convergent Algorithms for Solving Singular Equations and Smooth Reformulations of Complementarity Problems. 386-405 - Eduardo Casas, Fredi Tröltzsch:
Second-Order Necessary and Sufficient Optimality Conditions for Optimization Problems and Applications to Control Theory. 406-431 - Paul Tseng:
Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization. 432-469 - Stephen J. Wright:
Modifying SQP for Degenerate Problems. 470-497 - Mourad Baïou, Ali Ridha Mahjoub:
The Steiner Traveling Salesman Polytope and Related Polyhedra. 498-507 - Alberto Caprara:
Additive Bounding, Worst-Case Analysis, and the Breakpoint Median Problem. 508-519 - René Henrion, Abderrahim Jourani:
Subdifferential Conditions for Calmness of Convex Constraints. 520-534 - Aharon Ben-Tal, Arkadi Nemirovski, Cees Roos:
Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems. 535-560 - Petr Beremlijski, Jaroslav Haslinger, Michal Kocvara, Jirí V. Outrata:
Shape Optimization in Contact Problems with Coulomb Friction. 561-587 - Asen L. Dontchev, Houduo Qi, Liqun Qi, Hongxia Yin:
A Newton Method for Shape-Preserving Spline Interpolation. 588-602 - René Henrion, Abderrahim Jourani, Jirí V. Outrata:
On the Calmness of a Class of Multifunctions. 603-618 - Diethard Klatte, Bernd Kummer:
Constrained Minima and Lipschitzian Penalties in Metric Spaces. 619-633
Volume 13, Number 3, 2002
- Roger Fletcher, Nicholas I. M. Gould, Sven Leyffer, Philippe L. Toint, Andreas Wächter:
Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming. 635-659 - Uwe Naumann:
Cheaper Jacobians by Simulated Annealing. 660-674 - X. X. Huang, X. Q. Yang:
Nonlinear Lagrangian for Multiobjective Optimization and Applications to Duality and Exact Penalization. 675-692 - Yu-Hong Dai:
Convergence Properties of the BFGS Algoritm. 693-701 - Adrian S. Lewis:
Active Sets, Nonsmoothness, and Sensitivity. 702-725 - Chong Li, Kung Fu Ng:
On Best Approximation by Nonconvex Sets and Perturbation of Nonconvex Inequality Systems in Hilbert Spaces. 726-744 - Roberto Cominetti, Matias Courdurier:
Coupling General Penalty Schemes for Convex Programming with the Steepest Descent and the Proximal Point Algorithm. 745-765 - Yan-Qin Bai, Mohamed El Ghami, Cornelis Roos:
A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier. 766-782 - Michael C. Ferris, Todd S. Munson:
Interior-Point Methods for Massive Support Vector Machines. 783-804 - Michael Ulbrich:
Semismooth Newton Methods for Operator Equations in Function Spaces. 805-841 - Jacek Gondzio, Andreas Grothey:
Reoptimization With the Primal-Dual Interior Point Method. 842-864 - Michael Hintermüller, Kazufumi Ito, Karl Kunisch:
The Primal-Dual Active Set Strategy as a Semismooth Newton Method. 865-888 - Charles Audet, John E. Dennis Jr.:
Analysis of Generalized Pattern Searches. 889-903 - Vaithilingam Jeyakumar, Dinh The Luc:
Sharp Variational Conditions for Convex Composite Nonsmooth Functions. 904-920 - Michael C. Ferris, Jinho Lim, David M. Shepard:
An Optimization Approach for Radiosurgery Treatment Planning. 921-937 - Shoji Kamimura, Wataru Takahashi:
Strong Convergence of a Proximal-Type Algorithm in a Banach Space. 938-945
Volume 13, Number 4, 2003
- V. Jeyakumar:
Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints. 947-959 - Xin Chen, Houduo Qi, Paul Tseng:
Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems. 960-985 - Christophe Combari, Lionel Thibault:
Epiconvergence of Convexly Composite Functions in Banach Spaces. 986-1003 - Robert M. Freund:
On the Primal-Dual Geometry of Level Sets in Linear and Conic Optimization. 1004-1013 - Gerald Gruber, Franz Rendl:
Computational Experience with Stable Set Relaxations. 1014-1028 - Mohammad R. Oskoorouchi, Jean-Louis Goffin:
The Analytic Center Cutting Plane Method with Semidefinite Cuts. 1029-1053 - Renato D. C. Monteiro, Takashi Tsuchiya:
A Variant of the Vavasis--Ye Layered-Step Interior-Point Algorithm for Linear Programming. 1054-1079 - Alfredo N. Iusem, Teemu Pennanen, Benar Fux Svaiter:
Inexact Variants of the Proximal Point Algorithm without Monotonicity. 1080-1097 - Masao Fukushima, Zhi-Quan Luo, Paul Tseng:
A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization. 1098-1119 - Zdenek Dostál, Ana Friedlander, Sandra Augusta Santos:
Augmented Lagrangians with Adaptive Precision Control for Quadratic Programming with Simple Bounds and Equality Constraints. 1120-1140 - Waltraud Huyer, Arnold Neumaier:
A New Exact Penalty Function. 1141-1158 - Heinz H. Bauschke, Patrick L. Combettes:
Iterating Bregman Retractions. 1159-1173 - Robert Mifflin, Claudia A. Sagastizábal:
Primal-Dual Gradient Structured Functions: Second-Order Results; Links to Epi-Derivatives and Partly Smooth Functions. 1174-1194 - Yun-Bin Zhao, Duan Li:
A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P[sub 0] LCPs. 1195-1221 - Yu-Fei Yang, Dong-Hui Li, Liqun Qi:
A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization. 1222-1244
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-04 20:44 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:
