default search action
Optimization Methods and Software , Volume 19
Volume 19, Number 1, 2004
- Florian Jarre, Michal Kocvara:
Preface. 1-2
- Jean-Noël Corvellec, Sjur Didrik Flåm:
Non-Convex feasibility problems and proximal point methods. 3-14 - Roger Fletcher, Sven Leyffer
:
Solving mathematical programs with complementarity constraints as nonlinear programs. 15-40 - Charles Fortin, Henry Wolkowicz:
The trust region subproblem and semidefinite programming. 41-67 - Roland W. Freund, Florian Jarre:
An extension of the positive real lemma to descriptor systems. 69-87 - Antonio Fuduli
A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization. 89-102 - Christian Zillober, Klaus Schittkowski, K. Moritzen:
Very large scale optimization by sequential convex programming. 103-120
- Panos M. Pardalos:
Book review. 121-123
Volume 19, Number 2, 2004
- Hongwei Liu, Xinhui Wang, Sanyang Liu:
Feasible direction algorithm for solving the SDP relaxations of quadratic {-1, 1} programming problems. 125-136 - Gleb Beliakov
Cutting angle method - a tool for constrained global optimization. 137-151 - Mehiddin Al-Baali, Antonio Fuduli
On the performance of switching BFGS/SR1 algorithms for unconstrained optimization. 153-164 - Mohammed Fazle Baki, Raymond G. Vickson:
One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective. 165-178 - Stefan Volkwein:
Nonlinear conjugate gradient methods for the optimal control of laser surface hardening. 179-199 - Fredi Tröltzsch, Daniel Wachsmuth:
On convergence of a receding horizon method for parabolic boundary control. 201-216 - Roland Griesse
Parametric sensitivity analysis in optimal control of a reaction-diffusion system - part II: practical methods and examples. 217-242
- Juan Enrique Martínez-Legaz
Book review. 243-244 - Antanas Zilinskas:
Book review. 245-246
Volume 19, Numbers 3-4, 2004
- Naiyang Deng, Haibin Zhang:
Theoretical efficiency of a new inexact method of tangent hyperbolas. 247-265 - Giovanni Fasano
Conjugate gradient (CG)-type method for the solution of Newton's equation within optimization frameworks. 267-290 - Abdel-Rahman Hedar
Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization. 291-308 - Christian Kanzow:
Inexact semismooth Newton methods for large-scale complementarity problems. 309-325 - Stefan Körkel, Ekaterina A. Kostina, Hans Georg Bock, Johannes P. Schlöder:
Numerical methods for optimal control problems in design of robust optimal experiments for nonlinear dynamic processes. 327-338 - Urszula Ledzewicz
Comparison of optimal controls for a model in cancer chemotherapy with L1- and L2-type objectives. 339-350 - Dongdong Lei, John C. Mason:
Minimax approximation from a least squares solution. 351-359 - Heng Liang, Xiaoyan Liu, Fengshan Bai:
Optimization problem in multi-homogeneous homotopy method. 361-369 - Stefano Lucidi
A derivative-based algorithm for a particular class of mixed variable optimization problems. 371-387 - Shaohua Pan, Xiangsi Li:
A self-adjusting primal-dual interior point method for linear programs. 389-397 - M. J. D. Powell:
On the use of quadratic models in unconstrained minimization without derivatives. 399-411 - Argenes Siburian, Volker Rehbock
Numerical procedure for solving a class of singular optimal control problems. 413-426 - Bram Verweij, Laurence A. Wolsey:
Uncapacitated lot-sizing with buying, sales and backlogging. 427-436 - John L. Nazareth:
On CG algorithms as objects of scientific study: An appendix. 437-438
Volume 19, Number 5, 2004
- Michael C. Ferris, Mikhail V. Solodov:
Foreword: special issue for the 70th birthday of professor Olvi Mangasarian. 439-441 - M. Seetharama Gowda:
Inverse and implicit function theorems for H-differentiable and semismooth functions. 443-461 - Robert Mifflin, Claudia A. Sagastizábal
𝒱𝒰-smoothness and proximal point results for some nonconvex functions. 463-478 - Boris S. Mordukhovich:
Equilibrium problems with equilibrium constraints via multiobjective optimization. 479-492 - Asuman E. Ozdaglar, Dimitri P. Bertsekas:
The relation between pseudonormality and quasiregularity in constrained optimization. 493-506 - Christian Kanzow, Stefania Petra:
On a semismooth least squares formulation of complementarity problems with gap reduction. 507-525 - Daniel Ralph, Stephen J. Wright:
Some properties of regularization and penalization schemes for MPECs. 527-556 - Mikhail V. Solodov:
A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework. 557-575 - Michael C. Ferris, Meta M. Voelker, Hao Helen Zhang:
Model building with likelihood basis pursuit. 577-594 - Michal Kocvara
Solving nonconvex SDP problems of structural optimization with stability control. 595-609 - Jong-Shi Pang, Sven Leyffer
On the global minimization of the value-at-risk. 611-631 - Nobuo Yamashita, Zhi-Quan Luo:
A nonlinear complementarity approach to multiuser power control for digital subscriber lines. 633-652
Volume 19, Number 6, 2004
- Henry Wolkowicz:
Solving semidefinite programs using preconditioned conjugate gradients. 653-672 - Marjo S. Haarala, Kaisa Miettinen
New limited memory bundle method for large-scale nonsmooth optimization. 673-692 - X. Q. Yang, X. X. Huang:
Lower-order penalty methods for mathematical programs with complementarity constraints. 693-720 - Jerry Eriksson, Per-Åke Wedin:
Truncated Gauss-Newton algorithms for Ill-conditioned nonlinear least squares problems. 721-737
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-05 20:50 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: