default search action
Optimization Methods and Software , Volume 27
Volume 27, Number 1, 2012
- Deng-Feng Li
, Jiang-Xia Nan, Mao-Jun Zhang:
Interval programming models for matrix games with interval payoffs. 1-16 - Michaël Rademaker
Optimal monotone relabelling of partially non-monotone ordinal data. 17-31 - Yukai Hung, Weichung Wang
Accelerating parallel particle swarm optimization via GPU. 33-51 - Qiaolin Ye, Chunxia Zhao, Ning Ye:
Least squares twin support vector machine classification via maximum one-class within class variance. 53-69 - S. Sundhar Ram, Angelia Nedic
A new class of distributed optimization algorithms: application to regression of distributed data. 71-88 - Haw-ren Fang, Sven Leyffer
A pivoting algorithm for linear programming with linear complementarity constraints. 89-114 - Johan Löfberg:
Automatic robust convex programming. 115-129 - N. M. S. Karmitsa
Comparing different nonsmooth minimization methods and software. 131-153 - E. Alper Yildirim
On the accuracy of uniform polyhedral approximations of the copositive cone. 155-173
Volume 27, Number 2, 2012
- Bruce Christianson
Preface. 175
- Jean-Baptiste Caillau, Olivier Cots
Differential continuation for regular optimal control problems. 177-196 - Coralia Cartis, Nicholas I. M. Gould
Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization. 197-219 - Isabelle Charpentier
On higher-order differentiation in nonlinear mechanics. 221-232 - David A. Fournier, Hans J. Skaug, Johnoel Ancheta, James Ianelli, Arni Magnusson
AD Model Builder: using automatic differentiation for statistical inference of highly parameterized complex nonlinear models. 233-249 - Robert M. Gower
A new framework for the computation of Hessians. 251-273 - Geir Gundersen, Trond Steihaug
Sparsity in higher order methods for unconstrained optimization. 275-294 - David Juedes
Coloring Jacobians revisited: a new algorithm for star and~acyclic bicoloring. 295-309 - Andrew Lyons, Ilya Safro
Randomized heuristics for exploiting Jacobian scarcity. 311-322 - Marina Menshikova, Shaun A. Forth
Automatic differentiation of quadrature. 323-335 - Viktor Mosenkis, Uwe Naumann:
On optimality preserving eliminations for the minimum edge count and optimal Jacobian accumulation problems in linearized DAGs. 337-358 - Hermann Schichl, Mihály Csaba Markót
Algorithmic differentiation techniques for global optimization in the COCONUT environment. 359-372 - Andrea Walther
A first-order convergence analysis of trust-region methods with inexact Jacobians and inequality constraints. 373-389 - Sebastian F. Walter, Lutz Lehmann, René Lamour:
On evaluating higher-order derivatives of the QR decomposition of tall matrices with full column rank in forward and reverse mode algorithmic differentiation. 391-403
Volume 27, Number 3, 2012
- Marek J. Smietanski:
Some superlinearly convergent inexact generalized Newton method for solving nonsmooth equations. 405-417 - Zhaocheng Cui, Boying Wu:
A new trust region method with adaptive radius for unconstrained optimization. 419-429 - Qiaolin Ye, Chunxia Zhao, Ning Ye, Hao Zheng, Xiaobo Chen
A feature selection method for nonparallel plane support vector machine classification. 431-443 - Jian Zhang, Kecun Zhang:
An inexact smoothing method for the monotone complementarity problem over symmetric cones. 445-459 - Qinghong Zhang:
Embedding methods for semidefinite programming. 461-482 - Tim Hoheisel, Christian Kanzow, Alexandra Schwartz
Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints. 483-512 - Manuel V. C. Vieira
Interior-point methods based on kernel functions for symmetric optimization. 513-537 - Alexander Engau, Miguel F. Anjos
On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems. 539-559 - Andrew R. Conn, Luís Nunes Vicente
Bilevel derivative-free optimization and its application to robust optimization. 561-577
Volume 27, Numbers 4-5, 2012
- Mihai Anitescu, Goran Lesaja:
Special issue in honour of Professor Florian A. Potra's 60th Birthday. 579-581 - Neculai Andrei:
An accelerated conjugate gradient algorithm with guaranteed descent and conjugacy conditions for unconstrained optimization. 583-604 - Kurt M. Anstreicher:
Interior-point algorithms for a generalization of linear programming and weighted centring. 605-612 - Charles Audet, John E. Dennis Jr., Sébastien Le Digabel
Trade-off studies in blackbox optimization. 613-624 - Alexandru Cioaca, Mihai Alexe, Adrian Sandu:
Second-order adjoints for solving PDE-constrained optimization problems. 625-653 - Thomas Davi, Florian Jarre:
High-accuracy solution of large-scale semidefinite programs. 655-666 - Xuan Vinh Doan, Serge Kruk, Henry Wolkowicz:
A robust algorithm for semidefinite programming. 667-693 - Haw-ren Fang, Dianne P. O'Leary
Euclidean distance matrix completion problems. 695-717 - M. Seetharama Gowda, Jiyuan Tao, Roman Sznajder:
Complementarity properties of Peirce-diagonalizable linear transformations on Euclidean Jordan algebras. 719-733 - Osman Güler, Filiz Gürtuna:
Symmetry of convex sets and its applications to the extremal ellipsoids of convex bodies. 735-759 - Lanshan Han, M. Kanat Camlibel, Jong-Shi Pang, W. P. M. H. Heemels
A unified numerical scheme for linear-quadratic optimal control problems with joint control and state constraints. 761-799 - Meiyun Y. He, André L. Tits:
Infeasible constraint-reduced interior-point methods for linear optimization. 801-825 - Goran Lesaja, Guo-Qiang Wang, D. T. Zhu:
Interior-point methods for Cartesian P *(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions. 827-843 - Miles Lubin, Cosmin G. Petra, Mihai Anitescu
The parallel solution of dense saddle-point linear systems arising in stochastic programming. 845-864 - Sanjay Mehrotra, Kuo-Ling Huang:
Computational experience with a modified potential reduction algorithm for linear programming. 865-891 - Yurii E. Nesterov:
Towards non-symmetric conic optimization. 893-917 - Joanna M. Papakonstantinou, Richard A. Tapia:
Generation of classes of symmetric rank-2 secant updates and the maximality of the Davidon class. 919-929
Volume 27, Number 6, 2012
- Michael Hinze
The semi-smooth Newton method for variationally discretized control constrained elliptic optimal control problems; implementation, convergence and globalization. 933-950 - Lei Wu, Zhe Sun, Jinping Zeng:
A damped semismooth Newton iterative method for solving mixed linear complementarity problems. 951-967 - Dong-Hui Li, Qiong Li, Hongru Xu:
An almost smooth equation reformulation to the nonlinear complementarity problem and Newton's method. 969-981 - David Di Lorenzo, Giampaolo Liuzzi
A concave optimization-based approach for sparse portfolio selection. 983-1000 - Ernesto G. Birgin
The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems. 1001-1024 - Yongqiao Wang:
Robust ν-support vector machine based on worst-case conditional value-at-risk minimization. 1025-1038 - Ping Zhong:
Training robust support vector regression with smooth non-convex loss function. 1039-1058 - Christopher John Price
A cover partitioning method for bound constrained global optimization. 1059-1072 - Térence Bayen, Didier Henrion
Semidefinite programming for optimizing convex bodies under width constraints. 1073-1099 - Morten Larsen:
Branch and bound solution of the multidimensional assignment problem formulation of data association. 1101-1126 - Zaiwen Wen, Wotao Yin
On the convergence of an active-set method for ℓ1 minimization. 1127-1146
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-03 20:18 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: