Content
March 2012, Volume 52, Issue 3
- 499-508 Criteria and dimension reduction of linear multiple criteria optimization problems
by Nguyen Thoai - 509-535 Exact penalty and error bounds in DC programming
by Hoai Le Thi & Tao Pham Dinh & Huynh Ngai - 537-551 An improved algorithm to test copositivity
by Julia Sponsel & Stefan Bundfuss & Mirjam Dür - 553-574 An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem
by Harold Benson - 575-590 Global energy minimisation and cotranslational protein folding of HP models
by Graham Wood & Yumi Patton & David Fisher - 591-605 Mathematical programs with vanishing constraints: critical point theory
by Dominik Dorsch & Vladimir Shikhman & Oliver Stein - 607-626 A hybrid method for quantum global optimization
by Yipeng Liu & Gary Koehler - 627-639 An extragradient algorithm for solving bilevel pseudomonotone variational inequalities
by P. Anh & J. Kim & L. Muu - 641-661 Interior proximal methods for quasiconvex optimization
by Nils Langenberg & Rainer Tichatschke
February 2012, Volume 52, Issue 2
- 193-193 Special issue on “Optimization and optimal control with applications” for the 4th International Conference on Optimization and Control with Applications (OCA2009), June 6–11, 2009, Harbin, China
by S. Wang & K. Teo - 195-209 Global optimal solutions to a class of quadrinomial minimization problems with one quadratic constraint
by Y.-B Yuan & S.-C. Fang & D. Gao - 211-227 Nonlinear optimal feedback control for lunar module soft landing
by Jingyang Zhou & Kok Teo & Di Zhou & Guohui Zhao - 229-242 On zero duality gap in nonconvex quadratic programming problems
by X. Zheng & X. Sun & D. Li & Y. Xu - 243-252 Second-order differentiability of generalized perturbation maps
by S. Li & C. Liao - 253-263 Minimum recession-compatible subsets of closed convex sets
by Yiran He & Jie Sun - 265-280 Optimal switching control of a fed-batch fermentation process
by Chongyang Liu & Zhaohua Gong & Enmin Feng & Hongchao Yin - 281-290 Anticipating synchronization through optimal feedback control
by Tingwen Huang & David Gao & Chuandong Li & MingQing Xiao - 291-304 Robust dynamical compensator design for discrete-time linear periodic systems
by Lingling Lv & Guangren Duan & Haibin Su - 305-322 An adaptive least-squares collocation radial basis function method for the HJB equation
by H. Alwardi & S. Wang & L. Jennings & S. Richardson - 323-334 Exponential stability analysis and impulsive tracking control of uncertain time-delayed systems
by Yuanqiang Chen & Honglei Xu - 335-351 Variance or spectral density in sampled data filtering?
by Graham Goodwin & Juan Yuz & Mario Salgado & Juan Agüero - 353-367 Performance analysis and evaluation of an enhanced power saving class type III in IEEE 802.16 with self-similar traffic
by Shunfu Jin & Wuyi Yue & Li Han
January 2012, Volume 52, Issue 1
- 1-28 Convergence rate of McCormick relaxations
by Agustín Bompadre & Alexander Mitsos - 29-43 Vector optimization problem and generalized convexity
by M. Oveisiha & J. Zafarani - 45-55 Low dimensional simplex evolution: a new heuristic for global optimization
by Changtong Luo & Bo Yu - 57-77 Iterative method for fixed point problem, variational inequality and generalized mixed equilibrium problems with applications
by Yekini Shehu - 79-94 Characterizations for solidness of dual cones with applications
by Y. Chiang - 95-108 Augmented Lagrangian functions for constrained optimization problems
by Y. Zhou & X. Yang - 109-121 Weak efficiency in multiobjective variational problems under generalized convexity
by M. Arana-Jiménez & G. Ruiz-Garzón & A. Rufián-Lizana & R. Osuna-Gómez - 123-137 An efficient algorithm for maximal margin clustering
by Jiming Peng & Lopamudra Mukherjee & Vikas Singh & Dale Schuurmans & Linli Xu - 139-159 Dual extragradient algorithms extended to equilibrium problems
by Tran Quoc & Pham Anh & Le Muu - 161-169 Second order duality in minmax fractional programming with generalized univexity
by Sarita Sharma & T. Gulati - 171-192 A Differential Evolution algorithm to deal with box, linear and quadratic-convex constraints for boundary optimization
by Massimo Spadoni & Luciano Stefanini
December 2011, Volume 51, Issue 4
- 569-606 Generalized McCormick relaxations
by Joseph Scott & Matthew Stuber & Paul Barton - 607-640 Self-adaptive randomized and rank-based differential evolution for multimodal problems
by Onay Urfalioglu & Orhan Arikan - 641-655 The prox-Tikhonov regularization method for the proximal point algorithm in Banach spaces
by D. Sahu & J. Yao - 657-675 Existence results for proper efficient solutions of vector equilibrium problems and applications
by Adela Capătă - 677-688 Calmness of efficient solution maps in parametric vector optimization
by T. Chuong & A. Kruger & J.-C. Yao - 689-714 Generalized equilibrium problems and fixed point problems for nonexpansive semigroups in Hilbert spaces
by Uthai Kamraksa & Rabian Wangkeeree - 715-742 Low order-value approach for solving VaR-constrained optimization problems
by E. Birgin & L. Bueno & N. Krejić & J. Martínez - 743-751 Markov modelling and parameterisation of genetic evolutionary test generations
by Adriel Cheng & Cheng-Chew Lim
November 2011, Volume 51, Issue 3
- 377-393 Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs
by Hanif Sherali & Evrim Dalkiran - 395-412 Subdifferential properties of the minimal time function of linear control systems
by Yi Jiang & Yi He & Jie Sun - 413-427 Evolution hemivariational inequality problems with doubly nonlinear operators
by Zijia Peng & Zhenhai Liu - 429-446 Alternating direction method for bi-quadratic programming
by Sheng-Long Hu & Zheng-Hai Huang - 447-462 Maximum lifetime coverage preserving scheduling algorithms in sensor networks
by Maggie Cheng & Xuan Gong - 463-471 Heuristic algorithms for the inverse mixed integer linear programming problem
by Zhaoyang Duan & Lizhi Wang - 473-495 A new smoothing Broyden-like method for solving nonlinear complementarity problem with a P 0 -function
by Bilian Chen & Changfeng Ma - 497-514 New decision rules for exact search in N-Queens
by Pablo San Segundo - 515-540 Seeking global edges for traveling salesman problem in multi-start search
by Weiqi Li - 541-548 Continuity of approximate solution mappings for parametric equilibrium problems
by X. Li & S. Li - 549-568 Global optimality conditions and optimization methods for quadratic integer programming problems
by Z. Wu & G. Li & J. Quan
October 2011, Volume 51, Issue 2
- 185-187 Guest editorial: a special issue on optimization techniques for business intelligence systems
by Jie Lu & Guangquan Zhang - 189-208 A multi-criteria optimization model for humanitarian aid distribution
by Begoña Vitoriano & M. Ortuño & Gregorio Tirado & Javier Montero - 209-226 A comparison study of fuzzy MADM methods in nuclear safeguards evaluation
by Özgür Kabak & Da Ruan - 227-244 An intelligent multi-criteria optimization method for quick and market-oriented textile material design
by Xiaoguang Deng & Xianyi Zeng & Philippe Vroman & Ludovic Koehl - 245-254 Particle swarm optimization for bi-level pricing problems in supply chains
by Ya Gao & Guangquan Zhang & Jie Lu & Hui-Ming Wee - 255-270 Optimization algorithm for learning consistent belief rule-base from examples
by Jun Liu & Luis Martinez & Da Ruan & Rosa Rodriguez & Alberto Calzada - 271-284 An improved training algorithm for feedforward neural network learning based on terminal attractors
by Xinghuo Yu & Bin Wang & Batsukh Batbayar & Liuping Wang & Zhihong Man - 285-300 Maturity, distance and density (MD 2 ) metrics for optimizing trust prediction for business intelligence
by Muhammad Raza & Omar Hussain & Farookh Hussain & Elizabeth Chang - 301-311 Pareto-optimality of oblique decision trees from evolutionary algorithms
by Jose Pangilinan & Gerrit Janssens - 313-324 Constructing composite search directions with parameters in quadratic interpolation models
by Qinghua Zhou & Yan Li & Minghu Ha - 325-344 Incremental learning optimization on knowledge discovery in dynamic business intelligent systems
by Dun Liu & Tianrui Li & Da Ruan & Junbo Zhang - 345-360 Multitime dynamic programming for multiple integral actions
by Constantin Udrişte & Ionel Ţevy - 361-376 Riemannian convexity of functionals
by Constantin Udrişte & Andreea Bejenaru
September 2011, Volume 51, Issue 1
- 1-10 Min-max and robust polynomial optimization
by J. Lasserre - 11-26 Inexact Halpern-type proximal point algorithm
by O. Boikanyo & G. Moroşanu - 27-46 The general iterative methods for nonexpansive mappings in Banach spaces
by Rattanaporn Wangkeeree & Narin Petrot & Rabian Wangkeeree - 47-68 Discrete time dynamic traffic assignment models and solution algorithm for managed lanes
by Qipeng Zheng & Ashwin Arulselvan - 69-78 Iterative approximation method for finite family of relatively quasi nonexpansive mappings and systems of equilibrium problems
by Yekini Shehu - 79-104 Mixture surrogate models based on Dempster-Shafer theory for global optimization problems
by Juliane Müller & Robert Piché - 105-113 A new C-function for symmetric cone complementarity problems
by Jia Tang & Sanyang Liu & Changfeng Ma - 115-132 Geometric fit of a point set by generalized circles
by Mark-Christoph Körner & Jack Brimberg & Henrik Juel & Anita Schöbel - 133-148 A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm
by Yi-Feng Hung & Wei-Chih Chen - 149-183 Generalized Benders’ Decomposition for topology optimization problems
by Eduardo Muñoz & Mathias Stolpe
August 2011, Volume 50, Issue 4
- 555-556 Preface: Special issue SAGO08
by M. Montaz Ali & Eligius Hendrix - 557-573 Parallel algorithms for continuous multifacility competitive location problems
by J. Redondo & J. Fernández & I. García & P. Ortigosa - 575-596 Dynamic sample budget allocation in model-based optimization
by Jiaqiao Hu & Hyeong Chang & Michael Fu & Steven Marcus - 597-627 Pattern discrete and mixed Hit-and-Run for global optimization
by Huseyin Mete & Yanfang Shen & Zelda Zabinsky & Seksan Kiatsupaibul & Robert Smith - 629-644 A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms
by Jordan Ninin & Frédéric Messine - 645-655 On determining the cover of a simplex by spheres centered at its vertices
by L. Casado & I. García & B. Tóth & E. Hendrix - 657-673 An exact algorithm for the 0–1 linear knapsack problem with a single continuous variable
by Geng Lin & Wenxing Zhu & M. Ali - 675-694 A globally and superlinearly convergent quasi-Newton method for general box constrained variational inequalities without smoothing approximation
by Xuebin Wang & Changfeng Ma & Meiyan Li - 695-712 Nonconvex quadratically constrained quadratic programming: best D.C. decompositions and their SDP representations
by X. Zheng & X. Sun & D. Li - 713-728 A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation
by Jein-Shan Chen & Shaohua Pan & Chun-Hsu Ko
July 2011, Volume 50, Issue 3
- 371-378 A new topological minimax theorem with application
by Hoang Tuy - 379-396 Global descent methods for unconstrained global optimization
by Z. Wu & D. Li & L. Zhang - 397-416 An approximation algorithm for convex multi-objective programming problems
by Matthias Ehrgott & Lizhen Shao & Anita Schöbel - 417-437 Massively parallel differential evolution—pattern search optimization with graphics hardware acceleration: an investigation on bound constrained optimization problems
by Weihang Zhu - 439-455 Global optimization for the generalized polynomial sum of ratios problem
by Peiping Shen & Yuan Ma & Yongqiang Chen - 457-472 A new iterative algorithm for equilibrium and fixed point problems of nonexpansive mapping
by Zi-Ming Wang & Yongfu Su & Sun Cho & Wandong Lou - 473-483 Maximum information stored in a labeled connected network with minimum edges
by Chao-Lin Chen - 485-502 On the Dini-Hadamard subdifferential of the difference of two functions
by Radu Boţ & Delia-Maria Nechita - 503-518 A biased random-key genetic algorithm for routing and wavelength assignment
by Thiago Noronha & Mauricio Resende & Celso Ribeiro - 519-529 Second-order Kuhn-Tucker invex constrained problems
by Vsevolod Ivanov - 531-535 A note on the regularized proximal point algorithm
by Fenghui Wang - 537-547 Alternative principles and their applications
by Mircea Balaj - 549-553 Equivalent formulations of the gradient
by Sanjo Zlobec
May 2011, Volume 50, Issue 1
- 1-2 Preface
by Juan Martínez-Legaz & Wilfredo Sosa Sandoval - 3-22 Codifferential method for minimizing nonsmooth DC functions
by A. Bagirov & J. Ugon - 23-37 SSDB spaces and maximal monotonicity
by Stephen Simons - 39-57 Partial penalization for the solution of generalized Nash equilibrium problems
by Francisco Facchinei & Lorenzo Lampariello - 59-76 Korpelevich’s method for variational inequality problems in Banach spaces
by Alfredo Iusem & Mostafa Nasri - 77-91 Small sets in best approximation theory
by J. Revalski & N. Zhivkov - 93-105 Semicontinuity of the solution map of quasivariational inequalities
by D. Aussel & J. Cotrina - 107-118 Maximizing selections from the core of a cooperative game
by Hans Keiding - 119-125 Generalized Nash equilibrium problems for lower semi-continuous strategy maps
by P. Georgiev & P. Pardalos - 127-143 Optimizing microwind rural electrification projects. A case study in Peru
by Laia Ferrer-Martí & Rafael Pastor & G. Capó & Enrique Velo - 145-167 Enhanced metric regularity and Lipschitzian properties of variational systems
by Francisco Aragón Artacho & Boris Mordukhovich - 169-178 Transversality condition for singular infinite horizon calculus of variations
by Eladio Ocaña Anaya & Pierre Cartigny
April 2011, Volume 49, Issue 4
- 539-559 A particle swarm optimization-based hybrid algorithm for minimum concave cost network flow problems
by Shangyao Yan & Yu-Lin Shih & Wang-Tsang Lee - 561-574 Scalarization and pointwise well-posedness in vector optimization problems
by Gang Xiao & Hong Xiao & Sanyang Liu - 575-587 Nonmonotone equilibrium problems: coercivity conditions and weak regularization
by I. Konnov & D. Dyabilkin - 589-606 Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems
by George Mavrotas & José Figueira & Alexandros Antoniadis - 607-622 Chebyshev scalarization of solutions to the vector equilibrium problems
by X. Gong - 623-649 Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices
by Sanjay Mehrotra & Zhifeng Li - 651-678 Stochastic lot-sizing with backlogging: computational complexity analysis
by Yongpei Guan - 679-693 An extragradient-type method for generalized equilibrium problems involving strictly pseudocontractive mappings
by Xiaolong Qin & Sun Cho & Shin Kang - 695-705 Generalized vector implicit quasi complementarity problems
by Suhel Khan - 707-712 Counterexamples on some articles on quasi-variational inclusion problems
by H. Mohebi & M. Vatandoost - 713-725 Necessary optimality conditions for nonsmooth semi-infinite programming problems
by Nader Kanzi
March 2011, Volume 49, Issue 3
- 363-364 Preface
by Tao Pham Dinh & Hoai Le Thi - 365-379 Quasi-Newton methods in infinite-dimensional spaces and application to matrix equations
by Boubakeur Benahmed & Hocine Mokhtar-Kharroubi & Bruno Malafosse & Adnan Yassine - 381-396 On generalized Ekeland’s variational principle and equivalent formulations for set-valued mappings
by P. Khanh & D. Quy - 397-413 Knapsack problem with probability constraints
by Alexei Gaivoronski & Abdel Lisser & Rafael Lopez & Hu Xu - 415-423 Application of convex lexicographical optimization to the balance of GRTgaz gas grid
by Soizic Adam & J. Bonnans & Ruben Paraisy & Sébastien Veyrat - 425-434 An exact algorithm for solving the vertex separator problem
by Mohamed Didi Biha & Marie-Jean Meurs - 435-448 A blind image watermarking using multiresolution visibility map
by M. Luong & Q. Do & A. Beghdadi - 449-465 Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering
by Daniel Aloise & Pierre Hansen - 467-480 The small hexagon and heptagon with maximum sum of distances between vertices
by Charles Audet & Anthony Guillou & Pierre Hansen & Frédéric Messine & Sylvain Perron - 481-495 Properties of two DC algorithms in quadratic programming
by Hoai Le Thi & Tao Pham Dinh & Nguyen Yen - 497-504 Automatic differentiation for the optimization of a ship propulsion and steering system: a proof of concept
by Ralf Leidenberger & Karsten Urban - 505-519 The directional subdifferential of the difference of two convex functions
by Jean-Paul Penot - 521-537 On 2-stage robust LP with RHS uncertainty: complexity results and applications
by Michel Minoux
February 2011, Volume 49, Issue 2
- 185-212 Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm
by P. Nataraj & M. Arounassalame - 213-235 Identifying preferred solutions to Multi-Objective Binary Optimisation problems, with an application to the Multi-Objective Knapsack Problem
by Nikolaos Argyris & José Figueira & Alec Morton - 237-263 Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems
by Ching-Feng Wen & Hsien-Chung Wu - 265-280 Characterizing strict efficiency for convex multiobjective programming problems
by Anjana Gupta & Aparna Mehra & Davinder Bhatia - 281-291 A logarithmic-quadratic proximal point scalarization method for multiobjective programming
by Ronaldo Gregório & Paulo Oliveira - 293-311 Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
by Xinzhen Zhang & Chen Ling & Liqun Qi - 313-342 A generic approach to approximate efficiency and applications to vector optimization with set-valued maps
by C. Gutiérrez & B. Jiménez & V. Novo - 343-357 Degree theory for a generalized set-valued variational inequality with an application in Banach spaces
by Zhong Wang & Nan Huang - 359-362 Comments on “Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine”
by Jiping Tao & Zhijun Chao & Yugeng Xi
January 2011, Volume 49, Issue 1
- 1-14 Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems
by V. Jeyakumar & Guoyin Li - 15-21 Best proximity points: global optimal approximate solutions
by S. Sadiq Basha - 23-35 Optimality and duality in vector optimization involving generalized type I functions over cones
by S. Suneja & Seema Khurana & Meetu Bhatia - 37-47 A class of r-semipreinvex functions and optimality in nonlinear programming
by Ke Zhao & Xue Liu & Zhe Chen - 49-67 Model building using bi-level optimization
by G. Saharidis & I. Androulakis & M. Ierapetritou - 69-90 A new differential mutation base generator for differential evolution
by Chuan Lin & Anyong Qing & Quanyuan Feng - 91-107 Towards the global solution of the maximal correlation problem
by Lei-Hong Zhang & Li-Zhi Liao & Li-Ming Sun - 109-123 The column-sufficiency and row-sufficiency of the linear transformation on Hilbert spaces
by Xin-He Miao & Zheng-Hai Huang - 125-135 Approaching pooling design with smaller efficient ratio
by Suogang Gao & Zengti Li & Hongjie Du & Yan Shi & Weili Wu - 137-147 Multiobjective optimization problems with modified objective functions and cone constraints and applications
by Jia Chen & Yeol Cho & Jong Kim & Jun Li - 149-172 Study of multiscale global optimization based on parameter space partition
by Weitao Sun & Yuan Dong - 173-183 Counterexamples to some triality and tri-duality results
by M. Voisei & C. Zălinescu
December 2010, Volume 48, Issue 4
- 511-531 Optimal placement of UV-based communications relay nodes
by Oleg Burdakov & Patrick Doherty & Kaj Holmberg & Per-Magnus Olsson - 533-548 A heuristic method for the minimum toll booth problem
by Lihui Bai & Donald Hearn & Siriphong Lawphongpanich - 549-567 Partitioning procedure for polynomial optimization
by Polyxeni-Margarita Kleniati & Panos Parpas & Berç Rustem - 569-582 Pyramidal tours and multiple objectives
by Özgür Özpeynirci & Murat Köksalan - 583-593 Piece adding technique for convex maximization problems
by Dominique Fortin & Ider Tseveendorj - 595-632 An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary quadratic programs
by Tao Pham Dinh & Nam Nguyen Canh & Hoai Le Thi - 633-642 New dominating sets in social networks
by Xu Zhu & Jieun Yu & Wonjun Lee & Donghyun Kim & Shan Shan & Ding-Zhu Du - 643-656 Minimization of equilibrium problems, variational inequality problems and fixed point problems
by Yonghong Yao & Yeong-Cheng Liou & Shin Kang - 657-669 DC models for spherical separation
by A. Astorino & A. Fuduli & M. Gaudioso
October 2010, Volume 48, Issue 2
- 183-208 Duality and optimality conditions for generalized equilibrium problems involving DC functions
by N. Dinh & J. Strodiot & V. Nguyen - 209-213 On the norm of a dc function
by Rafael Blanquero & Emilio Carrizosa - 215-239 On numerical optimization theory of infinite kernel learning
by S. Özöğür-Akyüz & G.-W. Weber - 241-261 A new smoothing and regularization Newton method for P 0 -NCP
by Changfeng Ma - 263-277 A fractional programming approach for retail category price optimization
by Shivaram Subramanian & Hanif Sherali - 279-287 A quasi-variational approach to a competitive economic equilibrium problem without strong monotonicity assumption
by G. Anello & M. Donato & M. Milasi - 289-310 Continuous GRASP with a local active-set method for bound-constrained global optimization
by Ernesto Birgin & Erico Gozzi & Mauricio Resende & Ricardo Silva - 311-321 Refined optimality conditions for differences of convex functions
by Tuomo Valkonen - 323-334 Robust optimization with simulated annealing
by Dimitris Bertsimas & Omid Nohadani - 335-345 Bounds of redundant multicast routing problem with SRLG-diverse constraints: edge, path and tree models
by Zhe Liang & Wanpracha Art Chaovalitwongse
September 2010, Volume 48, Issue 1
- 1-2 Foreword: Special issue celebrating the 70th birthday of Roman G. Strongin
by Panos Pardalos & Yaroslav Sergeyev - 3-15 Methods of embedding-cutting off in problems of mathematical programming
by Valerian Bulatov - 17-27 A lower bound on convergence rates of nonadaptive algorithms for univariate optimization with noise
by James Calvin - 29-40 One-dimensional identification problem and ranking parameters
by V. Demyanova & V. Demyanov - 41-55 A genetic algorithm for a global optimization problem arising in the detection of gravitational waves
by Daniela di Serafino & Susana Gomez & Leopoldo Milano & Filippo Riccio & Gerardo Toraldo - 57-71 Linear and quadratic programming approaches for the general graph partitioning problem
by Neng Fan & Panos Pardalos - 73-85 A local search method for continuous global optimization
by M. Gaviano & D. Lera & A. Steri - 87-97 Stopping rules in k-adaptive global random search algorithms
by Anatoly Zhigljavsky & Emily Hamilton - 99-112 An information global minimization algorithm using the local improvement technique
by Daniela Lera & Yaroslav Sergeyev - 113-128 A partition-based global optimization algorithm
by Giampaolo Liuzzi & Stefano Lucidi & Veronica Piccialli - 129-143 On simulation of optimal strategies and Nash equilibrium in the financial market context
by Jonas Mockus - 145-157 Iterative regularization algorithms for constrained image deblurring on graphics processors
by Valeria Ruggiero & Thomas Serafini & Riccardo Zanella & Luca Zanni - 159-172 On computational search for optimistic solutions in bilevel problems
by Alexander Strekalovsky & Andrey Orlov & Anton Malyshev - 173-182 On similarities between two models of global optimization: statistical models and radial basis functions
by Antanas Žilinskas
August 2010, Volume 47, Issue 4
- 537-555 Pseudomonotone operators and the Bregman Proximal Point Algorithm
by Nils Langenberg - 557-582 Global solution of nonlinear mixed-integer bilevel programs
by Alexander Mitsos - 583-595 Global optimality conditions for cubic minimization problem with box or binary constraints
by Yanjun Wang & Zhian Liang - 597-613 A combined DCA: GA for constructing highly nonlinear balanced boolean functions in cryptography
by Hoai Le & Hoai Le Thi & Tao Pham Dinh & Pascal Bouvry - 615-637 Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm
by Jean Etoa - 639-660 Upper semicontinuity result for the solution mapping of a mixed parametric generalized vector quasiequilibrium problem with moving cones
by Le Tuan & Gue Lee & Pham Sach - 661-685 On convex relaxations of quadrilinear terms
by Sonia Cafieri & Jon Lee & Leo Liberti
July 2010, Volume 47, Issue 3
- 327-327 Preface
by Altannar Chinchuluun - 329-342 A polynomial path-following interior point algorithm for general linear complementarity problems
by Tibor Illés & Marianna Nagy & Tamás Terlaky - 343-354 A network flow model for biclustering via optimal re-ordering of data matrices
by Peter DiMaggio & Scott McAllister & Christodoulos Floudas & Xiao-Jiang Feng & Joshua Rabinowitz & Herschel Rabitz