default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Optimization, Volume 17
Volume 17, Number 1, 2006
- Juan F. Camino
, J. William Helton, Robert E. Skelton:
Solving Matrix Inequalities whose Unknowns are Matrices. 1-36 - Yun-Bin Zhao, Shu-Cherng Fang, Duan Li:
Constructing Generalized Mean Functions Using Convex Functions with Regularity Conditions. 37-51 - Sven Leyffer, Gabriel López-Calva, Jorge Nocedal:
Interior Methods for Mathematical Programs with Complementarity Constraints. 52-77 - Hoang Tuy, Michel Minoux, N. T. Hoai-Phuong:
Discrete Monotonic Optimization with Application to a Discrete Location Problem. 78-97 - Amir Beck, Aharon Ben-Tal:
On the Solution of the Tikhonov Regularization of the Total Least Squares Problem. 98-118 - André L. Tits, Pierre-Antoine Absil, William P. Woessner:
Constraint Reduction for Linear Programs with Many Inequality Constraints. 119-146 - Miguel A. Goberna, Maxim I. Todorov, Virginia N. Vera de Serio:
On the Stability of Convex-valued Mappings and Their Relative Boundary and Extreme Points Set Mappings. 147-158 - Michael Hintermüller, Karl Kunisch:
Path-following Methods for a Class of Constrained Minimization Problems in Function Space. 159-187 - Charles Audet, John E. Dennis Jr.:
Mesh Adaptive Direct Search Algorithms for Constrained Optimization. 188-217 - Hayato Waki, Sunyoung Kim, Masakazu Kojima, Masakazu Muramatsu:
Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity. 218-242 - X. X. Huang, X. Q. Yang:
Generalized Levitin--Polyak Well-Posedness in Constrained Optimization. 243-258 - Roger Fletcher, Sven Leyffer, Danny Ralph, Stefan Scholtes:
Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints. 259-286 - Zhaosong Lu, Renato D. C. Monteiro, Jerome W. O'Neal:
An Iterative Solver-Based Infeasible Primal-Dual Path-Following Algorithm for Convex Quadratic Programming. 287-310
Volume 17, Number 2, 2006
- Dorit S. Hochbaum, Asaf Levin:
Optimizing over Consecutive 1's and Circular 1's Constraints. 311-330 - Klaus Jansen:
Approximation Algorithm for the Mixed Fractional Packing and Covering Problem. 331-352 - Wen Song:
Calmness and Error Bounds for Convex Constraint Systems. 353-371 - Duan Li, Xiaoling Sun, F. L. Wang:
Convergent Lagrangian and Contour Cut Method for Nonlinear Integer Programming with a Quadratic Objective Function. 372-400 - Lifeng Chen, Yongli Wang, Guoping He:
A Feasible Active Set QP-Free Method for Nonlinear Programming. 401-429 - Paul T. Boggs, Kevin R. Long, Stephen B. Margolis, Patricia A. Howard:
Rapid Source Inversion for Chemical/Biological Attacks, Part 1: The Steady-State Case. 430-458 - Emre Erdogan, Garud Iyengar:
An Active Set Method for Single-Cone Second-Order Cone Programs. 459-484 - Juan González-Hernández, J. Rigoberto Gabriel, Onésimo Hernández-Lerma:
On Solutions to the Mass Transfer Problem. 485-499 - Thi Hong Linh Nguyen, Jean-Paul Penot:
Optimality Conditions for Quasiconvex Programs. 500-510 - Holger Heitsch, Werner Römisch, Cyrille Strugarek:
Stability of Multistage Stochastic Programs. 511-525 - William W. Hager, Hongchao Zhang:
A New Active Set Algorithm for Box Constrained Optimization. 526-557 - Leonid Faybusovich:
Jordan-Algebraic Approach to Convexity Theorems for Quadratic Mappings. 558-576 - Christina Oberlin, Stephen J. Wright:
Active Set Identification in Nonlinear Programming. 577-605 - Mark A. Abramson, Charles Audet:
Convergence of Mesh Adaptive Direct Search to Second-Order Stationary Points. 606-619
Volume 17, Number 3, 2006
- E. Alper Yildirim:
On the Minimum Volume Covering Ellipsoid of Ellipsoids. 621-641 - Charles Audet, Dominique Orban:
Finding Optimal Algorithmic Parameters Using Derivative-Free Optimization. 642-664 - Petra Mutzel, René Weiskircher:
Bend Minimization in Planar Orthogonal Drawings Using Integer Programming. 665-687 - César Gutiérrez, Bienvenido Jiménez, Vicente Novo:
A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems. 688-710 - Zhi Cai, Kim-Chuan Toh:
Solving Second Order Cone Programming via a Reduced Augmented System Approach. 711-737 - John Zweck, Susan E. Minkoff:
Modeling Compensation for Optical Fiber Communication Systems. 738-775 - Arnd Rösch, Fredi Tröltzsch:
Sufficient Second-Order Optimality Conditions for an Elliptic Optimal Control Problem with Pointwise Control-State Constraints. 776-794 - Yiran He, Jie Sun:
Second-Order Sufficient Conditions for Error Bounds in Banach Spaces. 795-805 - Jesús A. De Loera, Shmuel Onn:
All Linear and Integer Programs Are Slim 3-Way Transportation Programs. 806-821 - Jean B. Lasserre:
Convergent SDP-Relaxations in Polynomial Optimization with Sparsity. 822-843 - Amir Beck, Yonina C. Eldar:
Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints. 844-860 - Jacqueline Morgan, Vincenzo Scalzo:
Discontinuous but Well-Posed Optimization Problems. 861-870 - Xing Liu, Florian A. Potra:
Corrector-Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path. 871-890 - Fanwen Meng, Huifu Xu:
A Regularized Sample Average Approximation Method for Stochastic Mathematical Programs with Nonsmooth Equality Constraints. 891-919 - Markus Schweighofer:
Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares. 920-942
Volume 17, Number 4, 2006
- Tamara G. Kolda, Robert Michael Lewis, Virginia Torczon:
Stationarity Results for Generating Set Search for Linearly Constrained Optimization. 943-968 - Arkadi Nemirovski, Alexander Shapiro:
Convex Approximations of Chance Constrained Programs. 969-996 - Serge Dégerine, Abdelhamid Zaïdi:
Determinant Maximization of a Nonsymmetric Matrix with Quadratic Constraints. 997-1014 - Krzysztof C. Kiwiel:
A Proximal-Projection Bundle Method for Lagrangian Relaxation, Including Semidefinite Programming. 1015-1034 - Hermann Schichl, Arnold Neumaier:
Transposition Theorems and Qualification-Free Optimality Conditions. 1035-1055 - M. Kanat Camlibel, Jong-Shi Pang, Jinglai Shen:
Lyapunov Stability of Complementarity and Extended Systems. 1056-1101 - Michael W. Carter, Holly H. Jin, Michael A. Saunders, Yinyu Ye:
SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization. 1102-1128 - Akiko Yoshise:
Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones. 1129-1153 - Xi Yin Zheng, Kung Fu Ng:
The Lagrange Multiplier Rule for Multifunctions in Banach Spaces. 1154-1175 - Carlos Eduardo Ferreira, Fernando Mário de Oliveira Filho:
New Reduction Techniques for the Group Steiner Tree Problem. 1176-1188 - Raffaele Pesenti, Franca Rinaldi:
The Image Containment Problem and Some Classes of Polynomial Instances. 1189-1204
Volume 17, Number 4, 2007
- Jérôme Bolte, Aris Daniilidis, Adrian S. Lewis:
The [barred L]ojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems. 1205-1223 - Amir Beck:
Quadratic Matrix Programming. 1224-1238 - Radu Ioan Bot, Sorin-Mihai Grad, Gert Wanka:
Maximal Monotonicity for the Precomposition with a Linear Operator. 1239-1252 - Masao Fukushima, Paul Tseng:
An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints: Erratum. 1253-1257
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-11 20: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:
