default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Global Optimization, Volume 65
Volume 65, Number 1, May 2016
- Rentsen Enkhbat, Altannar Chinchuluun:
Preface. 1 - Anatoly S. Antipin
, Elena V. Khoroshilova:
Saddle point approach to solving problem of optimal control with fixed ends. 3-17 - Abderrahman Bouhamidi, Mustapha Hached, Khalide Jbilou:
A preconditioned block Arnoldi method for large scale Lyapunov and algebraic Riccati equations. 19-32 - Rentsen Enkhbat:
Global optimization approach to Malfatti's problem. 33-39 - Dominique Fortin, Ider Tseveendorj:
Generalized subdifferentials of the sign change counting function. 41-56 - Richard F. Hartl, Martin Romauch:
Notes on the single route lateral transhipment problem. 57-82 - Qiuhua Tang, Yanli Liang, Liping Zhang, Christodoulos A. Floudas, Xiaojun Cao:
Balancing mixed-model assembly lines with sequence-dependent tasks via hybrid genetic algorithm. 83-107 - Honglei Xu, Yi Zhang, Jin Yang, Guanglu Zhou, Louis Caccetta:
Practical exponential set stabilization for switched nonlinear systems with multiple subsystem equilibria. 109-118 - Alexander S. Strekalovsky, Maxim V. Yanulevich:
On global search in nonconvex optimal control problems. 119-135
Volume 65, Number 2, June 2016
- Serdar Karademir, Oleg A. Prokopyev, Robert J. Mailloux:
Irregular polyomino tiling via integer programming with application in phased array antenna design. 137-173 - Vaithilingam Jeyakumar, S. Kim, Gue Myung Lee, Guoyin Li:
Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets. 175-190 - Gene A. Bunin:
Extended reverse-convex programming: an approximate enumeration approach to global optimization. 191-229 - I. Esra Büyüktahtakin, Ning Liu:
Dynamic programming approximation algorithms for the capacitated lot-sizing problem. 231-259 - Hafid Zidani, José Eduardo Souza de Cursi, Rachid Ellaia:
Numerical approximation of the solution in infinite dimensional global optimization using a representation formula. 261-281 - Yuri Stoyan, Aleksandr V. Pankratov, Tatiana E. Romanova:
Quasi-phi-functions and optimal packing of ellipses. 283-307 - Francisco J. Aragón Artacho, Jonathan M. Borwein, Matthew K. Tam:
Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem. 309-327 - Heinz H. Bauschke, Minh Ngoc Dao, Dominikus Noll, Hung M. Phan:
On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces. 329-349 - Weifan Wang, Danjun Huang, Yanwen Wang, Yiqiao Wang, Ding-Zhu Du:
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs. 351-367 - Arnaud Vandaele, Nicolas Gillis, François Glineur, Daniel Tuyttens:
Heuristics for exact nonnegative matrix factorization. 369-400
Volume 65, Number 3, July 2016
- Bjarne A. Grimstad, Anders T. Sandnes:
Global optimization with spline constraints: a new branch-and-bound method based on B-splines. 401-439 - Christopher John Price, Marco Reale, Blair Lennon Robertson:
Stochastic filter methods for generally constrained global optimization. 441-456 - Ferenc Domes, Arnold Neumaier:
Linear and parabolic relaxations for quadratic constraints. 457-486 - Kun Lin, Steven I. Marcus:
Cumulative weighting optimization. 487-512 - Manuel Ruiz Galán:
A sharp Lagrange multiplier theorem for nonlinear programs. 513-530 - Milosz Kadzinski, Krzysztof Ciomek, Pawel Rychly, Roman Slowinski:
Post factum analysis for robust multiple criteria ranking and sorting. 531-562 - Zhe Yang, Yan Ju:
Existence and generic stability of cooperative equilibria for multi-leader-multi-follower games. 563-573 - Patrizia Daniele, Sofia Giuffrè, Mariagrazia Lorino:
Functional inequalities, regularity and computation of the deficit and surplus variables in the financial equilibrium problem. 575-596 - José Yunier Bello Cruz, R. Díaz Millán:
A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces. 597-614 - Nguyen Thanh Qui:
Coderivatives of implicit multifunctions and stability of variational systems. 615-635
Volume 65, Number 4, August 2016
- Marco Locatelli:
Non polyhedral convex envelopes for 1-convex functions. 637-655 - William W. Hager, Dzung T. Phan, Jiajie Zhu:
Projection algorithms for nonconvex minimization with application to sparse principal component analysis. 657-676 - Chungen Shen, Lei-Hong Zhang, Wei Liu:
A stabilized filter SQP algorithm for nonlinear programming. 677-708 - Ernesto G. Birgin, Rafael D. Lobato, José Mario Martínez:
Packing ellipsoids by nonlinear optimization. 709-743 - Navneet Vidyarthi, Sachin Jayaswal, Vikranth Babu Tirumala Chetty:
Bandwidth packing problem with queueing delays: modelling and exact solution approach. 745-776 - Hark-Chin Hwang, Hyun-Soo Ahn, Philip M. Kaminsky:
Algorithms for the two-stage production-capacitated lot-sizing problem. 777-799 - Zhao Zhang, Shuangshuang Li, Hong-Jian Lai, Ding-Zhu Du:
Algorithms for the partial inverse matroid problem in which weights can only be increased. 801-811 - Julliany S. Brandão, Thiago F. Noronha, Celso C. Ribeiro:
A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks. 813-835 - Ignacio Araya, Víctor Reyes:
Interval Branch-and-Bound algorithms for optimization and constraint satisfaction: a survey and prospects. 837-866
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-11-22 19:45 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:
