default search action
Computational Optimization and Applications, Volume 51
Volume 51, Number 1, January 2012
- Philip E. Gill, Daniel P. Robinson:
A primal-dual augmented Lagrangian. 1-25 - Benedetta Morini
, Margherita Porcelli
TRESNEI, a Matlab trust-region solver for systems of nonlinear equalities and inequalities. 27-49 - Michael Freimer, Jeffrey T. Linderoth, Douglas J. Thomas:
The impact of sampling methods on bias and variance in stochastic linear programs. 51-75 - Ankur A. Kulkarni, Uday V. Shanbhag:
Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms. 77-123 - Jin Hyuk Jung, Dianne P. O'Leary
Adaptive constraint reduction for convex quadratic programming. 125-157 - Wei Xu, Thomas F. Coleman, Gang Liu:
A secant method for nonlinear least-squares minimization. 159-173 - Xiaojiao Tong, Liqun Qi
A smoothing SQP method for nonlinear programs with stability constraints arising from power systems. 175-197 - Alexey F. Izmailov, A. L. Pogosyan, Mikhail V. Solodov:
Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints. 199-221 - Haijian Yang, Qingguo Li
Overlapping restricted additive Schwarz method applied to the linear complementarity problem with an H-matrix. 223-239 - Weijie Cong
Rank-two update algorithms for the minimum volume enclosing ellipsoid problem. 241-257 - Fuchang Gao
Implementing the Nelder-Mead simplex algorithm with adaptive parameters. 259-277 - Andrea Cassioli, David Di Lorenzo, Marco Locatelli
Machine learning for global optimization. 279-303 - Ronaldo Dias, Nancy Lopes Garcia
Monte Carlo algorithm for trajectory optimization based on Markovian readings. 305-321 - Frauke Liers
Partitioning planar graphs: a fast combinatorial approach for max-cut. 323-344 - Enrico Angelelli
Kernel Search: a new heuristic framework for portfolio selection. 345-361 - Isabel Martins
A branch-and-price approach for harvest scheduling subject to maximum area restrictions. 363-385 - Cesar Beltran-Royo
Semi-Lagrangian relaxation applied to the uncapacitated facility location problem. 387-409 - Hanen Akrout, Bassem Jarboui
A GRASP based on DE to solve single machine scheduling problem with SDST. 411-435 - Antonio Sedeño-Noda
An efficient label setting/correcting shortest path algorithm. 437-455
Volume 51, Number 2, March 2012
- Jacek Gondzio
Matrix-free interior point method. 457-480 - Hongchao Zhang, Andrew R. Conn:
On the local convergence of a derivative-free algorithm for least-squares minimization. 481-507 - Julia L. Higle, Lei Zhao
Adaptive and nonadaptive approaches to statistically based methods for solving stochastic linear programs: a computational investigation. 509-532 - Bernardo Llanas, Francisco J. Sáinz:
A local search algorithm for ray-convex polyhedron intersection. 533-550 - Sha Lu
A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization. 551-573 - Qingwei Jin, Lu Yu, John E. Lavery, Shu-Cherng Fang:
Univariate cubic L1 interpolating splines based on the first derivative and on 5-point windows: analysis, algorithm and shape-preserving properties. 575-600 - Takéhiko Nakama:
Markov chain analysis of genetic algorithms applied to fitness functions perturbed concurrently by additive and multiplicative noise. 601-622 - Juhe Sun, Jein-Shan Chen
Neural networks for solving second-order cone constrained variational inequality problem. 623-648 - Bingsheng He, Li-Zhi Liao
Proximal-like contraction methods for monotone variational inequalities in a unified framework I: Effective quadruplet and primary methods. 649-679 - Bingsheng He, Li-Zhi Liao
Proximal-like contraction methods for monotone variational inequalities in a unified framework II: general methods and numerical experiments. 681-708 - Tran Dinh Quoc, Le Dung Muu:
Iterative methods for solving monotone equilibrium problems via dual gap functions. 709-728 - Pierre Bonami, João P. M. Gonçalves:
Heuristics for convex mixed integer nonlinear programs. 729-747 - Pierre Fouilhoux, Ali Ridha Mahjoub:
Solving VLSI design and DNA sequencing problems using bipartization of graphs. 749-781 - Mhand Hifi, Toufik Saadi:
A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems. 783-807 - Sara Mattia:
Solving survivable two-layer network design problems by metric inequalities. 809-834 - Sergio González Andrade
Multigrid second-order accurate solution of parabolic control-constrained problems. 835-866 - Matthias Gerdts
Virtual control regularization of state constrained linear quadratic optimal control problems. 867-882 - Sven Beuchler, Clemens Pechstein, Daniel Wachsmuth:
Boundary concentrated finite elements for optimal boundary control problems of elliptic PDEs. 883-908 - Mapundi K. Banda
Adjoint IMEX-based schemes for control problems governed by hyperbolic conservation laws. 909-930 - Klaus Deckelnick, Michael Hinze
A note on the approximation of elliptic control problems with bang-bang controls. 931-939
Volume 51, Number 3, April 2012
- Ernesto G. Birgin
Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization. 941-965 - Serge Gratton, Vincent Malmedy, Philippe L. Toint
Using approximate secant equations in limited memory methods for multilevel unconstrained optimization. 967-979 - Junxiang Li, Limei Yan, Shudong Li, Jiazhen Huo:
Inexact trust region PGC method for large sparse unconstrained optimization. 981-999 - Luke B. Winternitz, Stacey O. Nicholls, André L. Tits, Dianne P. O'Leary
A constraint-reduced variant of Mehrotra's predictor-corrector algorithm. 1001-1036 - Jia Wu, Jein-Shan Chen
A proximal point algorithm for the monotone second-order cone complementarity problem. 1037-1063 - Yair Censor
On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints. 1065-1088 - Nicholas I. M. Gould
How good are extrapolated bi-projection methods for linear feasibility problems? 1089-1095 - Le Thi Hoai An
A DC programming approach for solving the symmetric Eigenvalue Complementarity Problem. 1097-1117 - Pedro Gajardo
Reconstructing a matrix from a partial sampling of Pareto eigenvalues. 1119-1135 - F. Gerlich, A. M. Giese, Jan H. Maruhn, Ekkehard W. Sachs:
Parameter identification in financial market models with a feasible point SQP algorithm. 1137-1161 - Xiangli Li
Non-monotone projection gradient method for non-negative matrix factorization. 1163-1171 - Stacey L. Faulkenberg, Margaret M. Wiecek:
Generating equidistant representations in biobjective programming. 1173-1210 - J. Cole Smith
A combinatorial optimization algorithm for solving the branchwidth problem. 1211-1229 - Nicolas Zufferey, Olivier Labarthe, David Schindl
Heuristics for a project management problem with incompatibility and assignment costs. 1231-1252 - Gio K. Kao, Edward C. Sewell, Sheldon H. Jacobson
New dominance rules and exploration strategies for the 1|ri|∑Ui scheduling problem. 1253-1274 - Jianlin Jiang, Xiaoming Yuan
A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand. 1275-1295 - Rafael Martí
A benchmark library and a comparison of heuristic methods for the linear ordering problem. 1297-1317 - Eduardo Casas
Numerical approximation of elliptic control problems with finitely many pointwise constraints. 1319-1343 - Karl Kunisch, Daniel Wachsmuth:
Path-following for optimal control of stationary variational inequalities. 1345-1373 - Patrizia Beraldi
Capital rationing problems under uncertainty and risk. 1375-1396 - Michal Cerný, Milan Hladík
Two complexity results on c-optimality in experimental design. 1397-1408
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-02 21:15 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: