[Opt-net] Contents, Optimization Methods and Software

[Oleg Burdakov]

Table of Contents
Optimization Methods and Software (OMS),
Volume 27, Number 3 (June, 2012)

Marek J. Smietanski
Some superlinearly convergent inexact generalized Newton method
for solving nonsmooth equations
405-417

Zhaocheng Cui and Boying Wu
A new trust region method with adaptive radius for
unconstrained optimization
419-429

Qiaolin Ye, Chunxia Zhao, Ning Ye and Xiaobo Chen
A feature selection method for nonparallel plane support vector
machine classification
431-442

Jian Zhang and Kecun Zhang
An inexact smoothing method for the monotone complementarity
problem over symmetric cones
443-457

Qinghong Zhang
Embedding methods for semidefinite programming
459-480

Tim Hoheisel, Christian Kanzow and Alexandra Schwartz
Convergence of a local regularization approach for mathematical
programs with complementarity or vanishing constraints
481-510

Manuel V.C. Vieira
Interior-point methods based on kernel functions for
symmetric optimization
511-536

Alexander Engau, Miguel F. Anjos and Anthony Vannelli
On handling cutting planes in interior-point methods for solving
semidefinite relaxations of binary quadratic optimization problems
537-557

A.R. Conn and L.N. Vicent
Bilevel derivative-free optimization and its
application to robust optimization
559-575


Volume 27, Number 4-5 (August, 2012)
Special issue dedicated to Florian Potra on the occassion of his
60th birthday
Guest-Editors: Mihai Anitescu and Goran Lesaja

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 centering
605-612

Charles Audet, J.E. Dennis Jr. and Sebastien Le Digabel
Trade-off studies in blackbox optimization
613-624

Alexandru Cioaca, Mihai Alexe and Adrian Sandu
Second-order adjoints for solving PDE-constrained
optimization problems
625-653

Thomas Davi and Florian Jarre
High accuracy solution of large scale semidefinite programs
655-666

Xuan Vinh Doan, Serge Kruk and Henry Wolkowicz
A robust algorithm for semidefinite programming
667-693

Haw-ren Fang and Dianne P. O'Leary
Euclidean distance matrix completion problems
695-717

M. Seetharama Gowda, J. Tao and Roman Sznajder
Complementarity properties of Peirce-diagonalizable linear
transformations on Euclidean Jordan algebras
719-733

Osman Guler and Filiz Gurtuna
Symmetry of convex sets and its applications to the
extremal ellipsoids of convex bodies
735-759

Lanshan Han, M. Kanat Camlibel, Jong-Shi Pang and W.P.Maurice H. Heemels
A unified numerical scheme for linear-quadratic optimal control
problems with joint control and state constraints
761-799

Meiyun Y. He and Andre L. Tits
Infeasible constraint-reduced interior-point methods for
linear optimization
801-825

G. Lesaja, G.Q. Wang and D.T. Zhu
Interior-point methods for Cartesian $P_*(\kappa)$-linear complementarity
problems over symmetric cones based on the eligible kernel functions
827-843

Miles Lubin, Cosmin G. Petra and Mihai Anitescu
On the parallel solution of dense saddle-point linear
systems arising in stochastic programming
845-864

Sanjay Mehrotra and Kuo-Ling Huang
Computational experience with a modified potential reduction
algorithm for linear programming

Yu. Nesterov
Towards nonsymmetric conic optimization
893-917

Joanna M. Papakonstantinou and Richard A. Tapia
On the generation of classes of symmetric rank-2 secant updates
and the maximality of the Davidon class
919-929

Forthcoming papers and complete table of contents for the journal OMS:
http://www.mai.liu.se/~olbur/contents

Instructions for Authors and Online sample copy:
http://www.tandfonline.com/goms

..................................................................
Oleg Burdakov, Editor-in-Chief, journal OMS

Division of Optimization,     |   Phone:  +46 13 281473
Department of Mathematics,    |   Fax:    +46 13 285770
Linkoping University,         |   E-mail: Oleg.Burdakov at liu.se
SE - 58183 Linkoping, Sweden  |   http://www.mai.liu.se/~olbur
::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::