Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOptimization Methods and Software , Volume 28
Volume 28, Number 1, 2013
- Changyu Wang, Wenling Zhao, Jinchuan Zhou, Shujun Lian:
Global convergence and finite termination of a class of smooth penalty function algorithms. 1-25 - Ørjan Bergmann, Trond Steihaug:
Solving trust-region subproblem augmented with linear inequality constraints. 26-36 - Yanping Chen
, Zuliang Lu, Min Fu:
A posteriori error estimates for mixed finite element approximation of nonlinear quadratic optimal control problems. 37-53 - Changtong Luo, Shaoliang Zhang, Bo Yu:
Some modifications of low-dimensional simplex evolution and their convergence. 54-81 - Philippe L. Toint:
Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization. 82-95 - Takafumi Kanamori, Atsumi Ohara:
A Bregman extension of quasi-Newton updates I: an information geometrical framework. 96-123 - Gleb Beliakov, Andrei V. Kelarev:
Global non-smooth optimization in robust multivariate regression. 124-138 - Andrew R. Conn, Sébastien Le Digabel:
Use of quadratic models with mesh-adaptive direct search for constrained black box optimization. 139-158 - Jeff C.-F. Wong, Bartosz Protas:
Application of scaled nonlinear conjugate-gradient algorithms to the inverse natural convection problem. 159-185 - Michal Cervinka, Ctirad Matonoha, Jirí V. Outrata:
On the computation of relaxed pessimistic solutions to MPECs. 186-206 - Glenn Fung, Olvi L. Mangasarian:
Privacy-preserving linear and nonlinear approximation via linear programming. 207-216 - Saman Babaie-Kafaki:
Erratum to: Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization. 217-219
Volume 28, Number 2, 2013
- Luigi Di Puglia Pugliese, Francesca Guerriero:
Dynamic programming approaches to solve the shortest path problem with forbidden paths. 221-255 - Nicolas P. Couellan, Theodore B. Trafalis:
On-line SVM learning via an incremental primal-dual technique. 256-275 - Athula Gunawardena, Michael C. Ferris, Robert R. Meyer:
A network approach for segmentation in intensity modulated arc therapy. 276-299 - Warren L. Hare, Mason S. Macklem:
Derivative-free optimization methods for finite minimax problems. 300-312 - David 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. 313-326 - Wei Li:
Dual-primal algorithm for linear optimization. 327-338 - Laurence Smith, John W. Chinneck, Victor C. Aitken:
Constraint consensus concentration for identifying disjoint feasible regions in nonlinear programmes. 339-363 - Iacopo Gentilini, François Margot, Kenji Shimada:
The travelling salesman problem with neighbourhoods: MINLP solution. 364-378 - Wah June Leong, Chuei Yee Chen:
A class of diagonal preconditioners for limited memory BFGS method. 379-392
Volume 28, Number 3, 2013
- Tamás Terlaky, Etienne de Klerk, Goran Lesaja, Dick den Hertog:
Special issue in honour of Professor Kees Roos' 70th Birthday. 393-395 - Martin S. Andersen, Joachim Dahl, Lieven Vandenberghe:
Logarithmic barriers for sparse matrix cones. 396-423 - Dimitris Bertsimas, Robert M. Freund, Xu Andy Sun:
An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems. 424-441 - David Bremner, Antoine Deza, William Hua, Lars Schewe:
More bounds on the diameters of convex polytopes. 442-450 - Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
A note about the complexity of minimizing Nesterov's smooth Chebyshev-Rosenbrock function. 451-457 - Mohammed Chahim, Ruud Brekelmans, Dick den Hertog, Peter M. Kort:
An impulse control approach to dike height optimization. 458-477 - Florian Jarre:
On Nesterov's smooth Chebyshev-Rosenbrock function. 478-484 - Etienne de Klerk, Marianna E.-Nagy, Renata Sotirov:
On semidefinite programming bounds for graph bandwidth. 485-500 - Shuangqing Liao, Christian van Delft, Jean-Philippe Vial:
Distributionally robust workforce scheduling in call centres with uncertain arrival rates. 501-522 - John E. Mitchell, Stephen Braun:
Rebalancing an investment portfolio in the presence of convex transaction costs, including market impact costs. 523-542 - Yurii E. Nesterov, Yu Xia:
Hessian distances and their applications in the complexity analysis of interior-point methods. 543-563 - Marielba Rojas, Bjørn H. Fotland, Trond Steihaug:
Computational and sensitivity aspects of eigenvalue-based methods for the large-scale trust-region subproblem. 564-580 - Manuel V. C. Vieira:
Interior-point methods for symmetric optimization based on a class of non-coercive kernel functions. 581-599 - Guo-Qiang Wang, Goran Lesaja:
Full Nesterov-Todd step feasible interior-point method for the Cartesian P *(κ)-SCLCP. 600-618 - Lipu Zhang, Yanqin Bai, Yinghong Xu:
A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function. 619-639 - Zhisu Zhu, Jiawei Zhang, Yinyu Ye:
Newsvendor optimization with limited distribution information. 640-667
Volume 28, Number 4, 2013
- Jie Sun, Xiaoling Sun, Ya-Xiang Yuan:
Foreword: Special issue on the 8th International Conference on Optimization: Techniques and Applications. 669 - Jiarui Chen, Wenxing Zhu:
A discrete dynamic convexized method for VLSI circuit partitioning. 670-688 - Zhi Guo Feng, Ka Fai Cedric Yiu, Kok Lay Teo:
A smoothing approach for the optimal parameter selection problem with continuous inequality constraint. 689-705 - Bingsheng He, Xiaoming Yuan:
Forward-backward-based descent methods for composite variational inequalities. 706-724 - Hongjin He, Deren Han, Wenyu Sun, Yannan Chen:
A hybrid splitting method for variational inequality problems with separable structure. 725-742 - Zi Xu:
New combinatorial direction stochastic approximation algorithms. 743-755 - Bo Jiang, Yu-Hong Dai:
Feasible Barzilai-Borwein-like methods for extreme symmetric eigenvalue problems. 756-784 - Pei-Yu Li, Zhi-Feng He, Gui-Hua Lin:
Sampling average approximation method for a class of stochastic Nash equilibrium problems. 785-795 - Shaojian Qu, Mark Goh, Bing Liang:
Trust region methods for solving multiobjective optimisation. 796-811 - Yi-Shuai Niu, Tao Pham Dinh, Hoai An Le Thi, Joaquim João Júdice:
Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem. 812-829 - Cheng Soon Ong, Le Thi Hoai An:
Learning sparse classifiers with difference of convex functions algorithms. 830-854 - Guozhen Tan, Jinghao Sun, Guangjian Hou:
The time-dependent rural postman problem: polyhedral results. 855-870 - Xiao Wang, Ya-Xiang Yuan:
A trust region method based on a new affine scaling technique for simple bounded optimization. 871-888 - Satoshi Washio, Syuuji Yamada, Tamaki Tanaka, Tetsuzo Tanino:
Expansion of the cross-efficiency evaluation by using the equations forming the efficient frontier in DEA. 889-899 - Ka Fai Cedric Yiu, Ming Jie 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. 900-916 - Jinping Zeng, Haixiong Yu:
A Newton-like method for solving a non-smooth elliptic equation. 917-929 - Xiaojin Zheng, Xiaoling Sun, Duan Li:
A note on semidefinite relaxation for 0-1 quadratic knapsack problems. 930-942
Volume 28, Number 5, 2013
- Wolfgang Hess, Stefan Ulbrich:
An inexact ℓ1 penalty SQP algorithm for PDE-constrained optimization with an application to shape optimization in linear elasticity. 943-968 - Martin Weiser:
On goal-oriented adaptivity for elliptic optimal control problems. 969-992 - Jeffrey Larson, Stefan M. Wild:
Non-intrusive termination of noisy optimization. 993-1011 - Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon:
A non-monotonic method for large-scale non-negative least squares. 1012-1039 - Saman Babaie-Kafaki, Masoud Fatemi:
A modified two-point stepsize gradient algorithm for unconstrained minimization. 1040-1050 - Paul Armand, Joël Benoist, Dominique Orban:
From global to local convergence of interior methods for nonlinear optimization. 1051-1080 - Dirk Breitenreicher, Jan Lellmann, Christoph Schnörr:
COAL: a generic modelling and prototyping framework for convex optimization problems of variational image analysis. 1081-1094 - Aswin Kannan, Uday V. Shanbhag, Harrison M. Kim:
Addressing supply-side risk in uncertain power markets: stochastic Nash models, scalable algorithms and error analysis. 1095-1138
Volume 28, Number 6, 2013
- Andreas Griewank:
On stable piecewise linearization and generalized algorithmic differentiation. 1139-1178 - Hongwei Liu, Changhe Liu, Ximei Yang:
New complexity analysis of a Mehrotra-type predictor-corrector algorithm for semidefinite programming. 1179-1194 - Radek Kucera, Jitka Machalová, Horymír Netuka, P. Zencák:
An interior-point algorithm for the minimization arising from 3D contact problems with friction. 1195-1217 - Shahadat Hossain, Trond Steihaug:
Optimal direct determination of sparse Jacobian matrices. 1218-1232 - Ubaldo 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. 1233-1261 - Zhaosong Lu:
Primal-dual first-order methods for a class of cone programming. 1262-1281 - Apostolos Kotsialos:
Non-smooth optimization based on resilient backpropagation search for unconstrained and simply bounded problems. 1282-1301 - Frank E. Curtis, Xiaocun Que:
An adaptive gradient sampling algorithm for non-smooth optimization. 1302-1324
a service of 
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-04-22 20:56 CEST 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:
