Nonlinear Optimization

Augmented Lagrangian methods under the Constant Positive Linear Dependence constraint qualification

  • Roberto Andreani
  • Ernesto G. Birgin
  • José Mario Martínez
  • María Laura Schuverdt
    • Categories Nonlinear Optimization Tags , , ,

    Two Augmented Lagrangian algorithms for solving KKT systems are introduced. The algorithms differ in the way in which penalty parameters are updated. Possibly infeasible accumulation points are characterized. It is proved that feasible limit points that satisfy the Constant Positive Linear Dependence constraint qualification are KKT solutions. Boundedness of the penalty parameters is proved under … Read more

    SENSITIVITY ANALYSIS IN CONVEX QUADRATIC OPTIMIZATION: INVARIANT SUPPORT SET INTERVAL

  • Alireza Ghaffari Hadigheh
  • Tamás Terlaky
    • Categories Quadratic Programming

    In sensitivity analysis one wants to know how the problem and the optimal solutions change under the variation of the input data. We consider the case when variation happens in the right hand side of the constraints and/or in the linear term of the objective function. We are interested to find the range of the … Read more

    Performance of CONDOR, a Parallel, Constrained extension of Powell’s UOBYQA algorithm. Experimental results and comparison with the DFO algorithm.

  • Hugues Bersini
  • Frank Vanden Berghen
    • Categories Constrained Nonlinear Optimization, Optimization of Systems modeled by PDEs, Parallel Algorithms Tags , , ,

    This paper presents an algorithmic extension of Powell’s UOBYQA algorithm (”Unconstrained Optimization BY Quadratical Approximation”). We start by summarizing the original algorithm of Powell and by presenting it in a more comprehensible form. Thereafter, we report comparative numerical results between UOBYQA, DFO and a parallel, constrained extension of UOBYQA that will be called in the … Read more

    Sensitivity of trust-region algorithms on their parameters

  • Nicholas I. M. Gould
  • Dominique Orban
  • Annick Sartenaer
  • Philippe L. Toint
    • Categories Bound-constrained Optimization, Unconstrained Optimization Tags , ,

    In this paper, we examine the sensitivity of trust-region algorithms on the parameters related to the step acceptance and update of the trust region. We show, in the context of unconstrained programming, that the numerical efficiency of these algorithms can easily be improved by choosing appropriate parameters. Recommanded ranges of values for these parameters are … Read more

    Recursive Trust-Region Methods for Multilevel Nonlinear Optimization (Part I): Global Convergence and Complexity

  • Serge Gratton
  • Annick Sartenaer
  • Philippe L. Toint
    • Categories Optimization of Systems modeled by PDEs, Systems governed by Differential Equations Optimization, Unconstrained Optimization Tags , , , ,

    A class of trust-region methods is presented for solving unconstrained nonlinear and possibly nonconvex discretized optimization problems, like those arising in systems governed by partial differential equations. The algorithms in this class make use of the discretization level as a mean of speeding up the computation of the step. This use is recursive, leading to … Read more

    Convergence Analysis of the DIRECT Algorithm

  • D. E. Finkel
  • C. T. Kelley
    • Categories Constrained Nonlinear Optimization, Global Optimization Theory, Nonsmooth Optimization Tags , , ,

    The DIRECT algorithm is a deterministic sampling method for bound constrained Lipschitz continuous optimization. We prove a subsequential convergence result for the DIRECT algorithm that quantifies some of the convergence observations in the literature. Our results apply to several variations on the original method, including one that will handle general constraints. We use techniques from … Read more

    A NEW SELF-CONCORDANT BARRIER FOR THE HYPERCUBE

  • Paulo Roberto Oliveira
  • Erik Alex Papa Quiroz
    • Categories Bound-constrained Optimization, Linear Programming Tags ,

    In this paper we introduce a new barrier function $\sum\limits_{i=1}^n(2x_i-1)[\ln{x_i}-\ln(1-x_i)]$ to solve the following optimization problem: $\min\,\, f(x)$ subject to: $Ax=b;\;\;0\leq x\leq e$. We show that this function is a $(3/2)n$-self-concordant barrier on the hypercube $[0,1]^n$. We prove that the central path is well defined and that under an additional assumption on the objective function, … Read more

    ON USING THE ELASTIC MODE IN NONLINEAR PROGRAMMING APPROACHES TO MATHEMATICALPROGRAMS WITH COMPLEMENTARITY CONSTRAINTS

  • Mihai Anitescu
    • Categories Complementarity and Variational Inequalities, Constrained Nonlinear Optimization Tags , , , , ,

    We investigate the possibility of solving mathematical programs with complementarity constraints (MPCCs) using algorithms and procedures of smooth nonlinear programming. Although MPCCs do not satisfy a constraint qualification, we establish sucient conditions for their Lagrange multiplier set to be nonempty. MPCCs that have nonempty Lagrange multiplier sets and that satisfy the quadratic growth condition can … Read more

    GLOBAL CONVERGENCE OF AN ELASTIC MODE APPROACH FOR A CLASS OF MATHEMATICAL PROGRAMS WITH COMPLEMENTARITY CONSTRAINTS

  • Mihai Anitescu
    • Categories Complementarity and Variational Inequalities, Constrained Nonlinear Optimization, Mechanical Engineering Tags , , ,

    We prove that any accumulation point of an elastic mode approach, applied to the optimization of a mixed P variational inequality, that approximately solves the relaxed subproblems is a C-stationary point of the problem of optimizing a parametric mixed P variational inequality. If, in addition, the accumulation point satis es the MPCC-LICQ constraint quali cation and if … Read more

    Recovering Risk-Neutral Probability Density Functions from Options Prices using Cubic Splines

  • Ana M. Monteiro
  • Reha H. Tütüncü
  • Luis Nunes Vicente
    • Categories Finance and Economics, Quadratic Programming, Semi-definite Programming Tags , , , ,

    We present a new approach to estimate the risk-neutral probability density function (pdf) of the future prices of an underlying asset from the prices of options written on the asset. The estimation is carried out in the space of cubic spline functions, yielding appropriate smoothness. The resulting optimization problem, used to invert the data and … Read more