External Links

    Journal: Optimization Methods and Software

    Volume 17, Issue 6

    985 -- 1008Yan-Qin Bai, Cees Roos, Mohamed El Ghami. A primal-dual interior-point method for linear optimization based on a new proximity function
    1009 -- 1032Michael C. Ferris, Meta M. Voelker. Slice models in general purpose modeling systems: An application to DEA
    1033 -- 1058Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende, C. C. Ribeiro. Randomized heuristics for the Max-Cut problem
    1059 -- 1076Gianpaolo Ghiani, Lucio Grandinetti, Francesca Guerriero, Roberto Musmanno. A Lagrangean heuristic for the plant location problem with multiple facilities in the same site
    1077 -- 1104Jiming Peng, Tamás Terlaky. A dynamic large-update primal-dual interior-point method for linear optimization
    1105 -- 1154Jos F. Sturm. Implementation of interior point methods for mixed semidefinite and second order cone optimization problems

    Volume 17, Issue 5

    749 -- 781Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan. Generating dual-bounded hypergraphs
    783 -- 804Alexey V. Demyanov, Vladimir F. Demyanov, V. N. Malozemov. Minmaxmin problems revisited
    805 -- 867Jean-Louis Goffin, Jean-Philippe Vial. Convex nondifferentiable optimization: A survey focused on the analytic center cutting plane method
    869 -- 889Andreas Griewank, Andrea Walther. On constrained optimization by adjoint based quasi-Newton methods
    891 -- 912Abdel-Rahman Hedar, Masao Fukushima. Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization
    913 -- 929O. L. Mangasarian. A finite newton method for classification
    931 -- 964Alex M. Rubinov, X. Q. Yang, Adil M. Bagirov. Penalty functions with a small penalty parameter
    965 -- 983Mikhail V. Solodov, Benar Fux Svaiter. A new proximal-based globalization strategy for the Josephy-Newton method for variational inequalities

    Volume 17, Issue 4

    561 -- 586Maria Grazia Gasparo, Sandra Pieraccini, Alessandro Armellini. An Infeasible Interior-Point Method with Nonmonotonic Complementarity Gaps
    587 -- 604Zong-wu Zhu. A Modified Trust Region Algorithm
    605 -- 626Hiroshige Dan, Nobuo Yamashita, Masao Fukushima. Convergence Properties of the Inexact Levenberg-Marquardt Method under Local Error Bound Conditions
    627 -- 654Francesca Guerriero, M. Mancini, Roberto Musmanno. New Rollout Algorithms for Combinatorial Optimization Problems
    655 -- 681Bao-Zhu Guo. Riesz Basis Approach to the Tracking Control of a Flexible Beam with a Tip Rigid Body without Dissipativity
    683 -- 700Dexuan Xie, Tamar Schlick. A More Lenient Stopping Rule for Line Search Algorithms
    701 -- 716Brian J. Driessen, Nader Sadegh. Inequality-Equality Constrained Optimization: An Analytical Robustness Comparison of a Feasibility Method Versus L1 Sequential Quadratic Programming
    717 -- 745Sungmook Lim, Soondal Park. LPAKO: A Simplex-based Linear Programming Program

    Volume 17, Issue 3

    359 -- 382Patrizia Beraldi, Andrzej Ruszczynski. A branch and bound method for stochastic integer problems under probabilistic constraints
    383 -- 407Jörgen Blomvall, Per Olov Lindberg. A Riccati-based primal interior point solver for multistage stochastic programming - extensions
    409 -- 422József Bukszár, Tamás Szántai. Probability bounds given by hypercherry trees
    423 -- 443Christian Condevaux-Lanloy, Emmanuel Fragnière, Alan King>. SISP: Simplified interface for stochastic programmingEstablishing a Hard Link between Mathematical Programming Modeling Languages and SMPS Codes
    445 -- 492Csaba I. Fábián, András Prékopa, Olga Ruf-Fiedler. On a dual method for a specially structured linear programming problem with application to stochastic programming
    493 -- 504Sjur Didrik Flåm. Stochastic programming, cooperation, and risk exchange
    505 -- 522Riho Lepp. Approximation of the quantile minimization problem with decision rules
    523 -- 542Alexander Shapiro, Anton J. Kleywegt. Minimax analysis of stochastic problems
    543 -- 559Béla Vizvári. The integer programming background of a stochastic integer programming algorithm of dentcheva-prékopa-ruszczyński

    Volume 17, Issue 2

    177 -- 206Alexander B. Kurzhanski, Pravin Varaiya. On Ellipsoidal Techniques for Reachability Analysis. Part I: External Approximations
    207 -- 237Alexander B. Kurzhanski, Pravin Varaiya. On Ellipsoidal Techniques for Reachability Analysis. Part II: Internal Approximations Box-valued Constraints
    239 -- 250Murat Subasi. Optimal Control of Heat Source in a Heat Conductivity Problem
    251 -- 269Klaus Beer, Viktor A. Skokov. Cutting Plane Methods Based on the Analytic Barrier for Minimization of a Convex Function Subject to Box-Constraints
    271 -- 292Igor V. Konnov. A Combined Relaxation Method for Nonlinear Variational Inequalities
    293 -- 317Michael Doumpos, Constantin Zopounidis. On the Development of an Outranking Relation for Ordinal Classification Problems: An Experimental Investigation of a New Methodology
    319 -- 352John W. Chinneck. Discovering the Characteristics of Mathematical Programs via Sampling

    Volume 17, Issue 1

    1 -- 29Marko Mäkelä. Survey of Bundle Methods for Nonsmooth Optimization
    31 -- 60Adil M. Bagirov. A Method for Minimization of Quasidifferentiable Functions
    61 -- 75Jianzhong Zhang 0001, Zhenhong Liu. An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems
    77 -- 111Stefan Volkwein. Mesh-Independence of Lagrange-SQP Methods with Lipschitz-Continuous Lagrange Multiplier Updates
    113 -- 127Marco Gaviano, Daniela Lera. A Complexity Analysis of Local Search Algorithms in Global Optimization
    129 -- 164Christèle Faure. Adjoining Strategies for Multi-layered Programs
    runs on