Journal: Optimization Methods and Software

Volume 28, Issue 6

1139 -- 1178Andreas Griewank. On stable piecewise linearization and generalized algorithmic differentiation
1179 -- 1194Hongwei Liu, Changhe Liu, Ximei Yang. New complexity analysis of a Mehrotra-type predictor-corrector algorithm for semidefinite programming
1195 -- 1217Radek Kucera, J. Machalová, H. Netuka, P. Zencák. An interior-point algorithm for the minimization arising from 3D contact problems with friction
1218 -- 1232Shahadat Hossain, Trond Steihaug. Optimal direct determination of sparse Jacobian matrices
1233 -- 1261Ubaldo M. García-Palomares, Ildemaro J. García-Urrea, Pedro S. Rodríguez-Hernández. On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization
1262 -- 1281Zhaosong Lu. Primal-dual first-order methods for a class of cone programming
1282 -- 1301Apostolos Kotsialos. Non-smooth optimization based on resilient backpropagation search for unconstrained and simply bounded problems
1302 -- 1324Frank E. Curtis, Xiaocun Que. An adaptive gradient sampling algorithm for non-smooth optimization

Volume 28, Issue 5

943 -- 968Wolfgang Hess, Stefan Ulbrich. 1 penalty SQP algorithm for PDE-constrained optimization with an application to shape optimization in linear elasticity
969 -- 992Martin Weiser. On goal-oriented adaptivity for elliptic optimal control problems
993 -- 1011Jeffrey Larson, Stefan M. Wild. Non-intrusive termination of noisy optimization
1012 -- 1039Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon. A non-monotonic method for large-scale non-negative least squares
1040 -- 1050Saman Babaie-Kafaki, Masoud Fatemi. A modified two-point stepsize gradient algorithm for unconstrained minimization
1051 -- 1080Paul Armand, Joël Benoist, Dominique Orban. From global to local convergence of interior methods for nonlinear optimization
1081 -- 1094Dirk Breitenreicher, Jan Lellmann, Christoph Schnörr. COAL: a generic modelling and prototyping framework for convex optimization problems of variational image analysis
1095 -- 1138Aswin Kannan, Uday V. Shanbhag, Harrison M. Kim. Addressing supply-side risk in uncertain power markets: stochastic Nash models, scalable algorithms and error analysis

Volume 28, Issue 4

669 -- 0Jie Sun, Xiaoling Sun, Ya-Xiang Yuan. Foreword: Special issue on the 8th International Conference on Optimization: Techniques and Applications
670 -- 688Jiarui Chen, Wenxing Zhu. A discrete dynamic convexized method for VLSI circuit partitioning
689 -- 705Zhi Guo Feng, Ka Fai Cedric Yiu, Kok Lay Teo. A smoothing approach for the optimal parameter selection problem with continuous inequality constraint
706 -- 724Bingsheng He, Xiaoming Yuan. Forward-backward-based descent methods for composite variational inequalities
725 -- 742Hongjin He, Deren Han, Wenyu Sun, Yannan Chen. A hybrid splitting method for variational inequality problems with separable structure
743 -- 755Zi Xu. New combinatorial direction stochastic approximation algorithms
756 -- 784Bo Jiang, Yu-Hong Dai. Feasible Barzilai-Borwein-like methods for extreme symmetric eigenvalue problems
785 -- 795Pei-yu Li, Zhi-Feng He, Gui-Hua Lin. Sampling average approximation method for a class of stochastic Nash equilibrium problems
796 -- 811Shaojian Qu, Mark Goh, Bing Liang. Trust region methods for solving multiobjective optimisation
812 -- 829Y. S. Niu, T. Pham Dinh, H. A. Le Thi, Joaquim João Júdice. Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem
830 -- 854Cheng Soon Ong, Le Thi Hoai An. Learning sparse classifiers with difference of convex functions algorithms
855 -- 870Guozhen Tan, Jinghao Sun, Guangjian Hou. The time-dependent rural postman problem: polyhedral results
871 -- 888Xiao Wang, Ya-Xiang Yuan. A trust region method based on a new affine scaling technique for simple bounded optimization
889 -- 899Satoshi Washio, Syuuji Yamada, Tamaki Tanaka, Tetsuzo Tanino. Expansion of the cross-efficiency evaluation by using the equations forming the efficient frontier in DEA
900 -- 916K. F. C. Yiu, M. J. Gao, T. J. Shiu, S. Y. Wu, T. Tran, I. Claesson. A fast algorithm for the optimal design of high accuracy windows in signal processing
917 -- 929Jinping Zeng, Haixiong Yu. A Newton-like method for solving a non-smooth elliptic equation
930 -- 942Xiaojin Zheng, Xiaoling Sun, Duan Li. A note on semidefinite relaxation for 0-1 quadratic knapsack problems

Volume 28, Issue 3

393 -- 395Tamás Terlaky, Etienne de Klerk, Goran Lesaja, Dick den Hertog. Special issue in honour of Professor Kees Roos' 70th Birthday
396 -- 423Martin S. Andersen, Joachim Dahl, Lieven Vandenberghe. Logarithmic barriers for sparse matrix cones
424 -- 441Dimitris Bertsimas, Robert M. Freund, Xu Andy Sun. An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems
442 -- 450David Bremner, Antoine Deza, William Hua, Lars Schewe. More bounds on the diameters of convex polytopes
451 -- 457Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint. A note about the complexity of minimizing Nesterov's smooth Chebyshev-Rosenbrock function
458 -- 477Mohammed Chahim, Ruud Brekelmans, Dick den Hertog, Peter M. Kort. An impulse control approach to dike height optimization
478 -- 484Florian Jarre. On Nesterov's smooth Chebyshev-Rosenbrock function
485 -- 500Etienne de Klerk, Marianna E.-Nagy, Renata Sotirov. On semidefinite programming bounds for graph bandwidth
501 -- 522S. Liao, Christian Van Delft, Jean-Philippe Vial. Distributionally robust workforce scheduling in call centres with uncertain arrival rates
523 -- 542John E. Mitchell, Stephen Braun. Rebalancing an investment portfolio in the presence of convex transaction costs, including market impact costs
543 -- 563Yurii Nesterov, Yu Xia. Hessian distances and their applications in the complexity analysis of interior-point methods
564 -- 580Marielba Rojas, Bjørn H. Fotland, Trond Steihaug. Computational and sensitivity aspects of eigenvalue-based methods for the large-scale trust-region subproblem
581 -- 599Manuel V. C. Vieira. Interior-point methods for symmetric optimization based on a class of non-coercive kernel functions
600 -- 618Guo Qiang Wang, Goran Lesaja. *(κ)-SCLCP
619 -- 639Lipu Zhang, Yanqin Bai, Yinghong Xu. A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function
640 -- 667Zhisu Zhu, Jiawei Zhang, Yinyu Ye. Newsvendor optimization with limited distribution information

Volume 28, Issue 2

221 -- 255Luigi Di Puglia Pugliese, Francesca Guerriero. Dynamic programming approaches to solve the shortest path problem with forbidden paths
256 -- 275Nicolas P. Couellan, Theodore B. Trafalis. On-line SVM learning via an incremental primal-dual technique
276 -- 299Athula Gunawardena, Michael C. Ferris, Robert R. Meyer. A network approach for segmentation in intensity modulated arc therapy
300 -- 312Warren Hare, Mason S. Macklem. Derivative-free optimization methods for finite minimax problems
313 -- 326David Yang Gao, Layne T. Watson, David R. Easterling, William I. Thacker, Stephen C. Billups. Solving the canonical dual of box- and integer-constrained nonconvex quadratic programs via a deterministic direct search algorithm
327 -- 338Wei Li. Dual-primal algorithm for linear optimization
339 -- 363Laurence Smith, John Chinneck, Victor C. Aitken. Constraint consensus concentration for identifying disjoint feasible regions in nonlinear programmes
364 -- 378Iacopo Gentilini, François Margot, Kenji Shimada. The travelling salesman problem with neighbourhoods: MINLP solution
379 -- 392Wah June Leong, Chuei Yee Chen. A class of diagonal preconditioners for limited memory BFGS method

Volume 28, Issue 1

1 -- 25Changyu Wang, Wenling Zhao, Jinchuan Zhou, Shujun Lian. Global convergence and finite termination of a class of smooth penalty function algorithms
26 -- 36Ørjan Bergmann, Trond Steihaug. Solving trust-region subproblem augmented with linear inequality constraints
37 -- 53Yanping Chen, Zuliang Lu, Min Fu. A posteriori error estimates for mixed finite element approximation of nonlinear quadratic optimal control problems
54 -- 81Changtong Luo, Shaoliang Zhang, Bo Yu 0003. Some modifications of low-dimensional simplex evolution and their convergence
82 -- 95Philippe L. Toint. Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization
96 -- 123Takafumi Kanamori, Atsumi Ohara. A Bregman extension of quasi-Newton updates I: an information geometrical framework
124 -- 138Gleb Beliakov, Andrei Kelarev. Global non-smooth optimization in robust multivariate regression
139 -- 158Andrew R. Conn, Sébastien Le Digabel. Use of quadratic models with mesh-adaptive direct search for constrained black box optimization
159 -- 185Jeff C.-F. Wong, Bartosz Protas. Application of scaled nonlinear conjugate-gradient algorithms to the inverse natural convection problem
186 -- 206Michal Cervinka, C. Matonoha, Jirí V. Outrata. On the computation of relaxed pessimistic solutions to MPECs
207 -- 216Glenn Fung, Olvi L. Mangasarian. Privacy-preserving linear and nonlinear approximation via linear programming
217 -- 219Saman Babaie-Kafaki. Erratum to: Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization