Constrained Nonlinear Optimization

High-Order Evaluation Complexity for Convexly-Constrained Optimization with Non-Lipschitzian Group Sparsity Terms

  • Xiaojun Chen
  • Philippe L. Toint
    • Categories Constrained Nonlinear Optimization, Data-Mining, Statistics Tags , , , , ,

    This paper studies high-order evaluation complexity for partially separable convexly-constrained optimization involving non-Lipschitzian group sparsity terms in a nonconvex objective function. We propose a partially separable adaptive regularization algorithm using a $p$-th order Taylor model and show that the algorithm can produce an (epsilon,delta)-approximate q-th-order stationary point in at most O(epsilon^{-(p+1)/(p-q+1)}) evaluations of the objective … Read more

    Pathfollowing for Parametric Mathematical Programs with Complementarity Constraints

  • Johannes Jäschke
  • Vyacheslav Kungurtsev
    • Categories Constrained Nonlinear Optimization

    In this paper we study procedures for pathfollowing parametric mathematical pro- grams with complementarity constraints. We present two procedures, one based on the penalty approach to solving standalone MPCCs, and one based on tracing active set bifurcations aris- ing from doubly-active complementarity constraints. We demonstrate the performance of these approaches on a variety of examples … Read more

    Tangencies and Polynomial Optimization

  • Tiên-So'n Pham
    • Categories Constrained Nonlinear Optimization, Global Optimization Theory Tags , , , , , , , , ,

    Given a polynomial function $f \colon \mathbb{R}^n \rightarrow \mathbb{R}$ and a unbounded basic closed semi-algebraic set $S \subset \mathbb{R}^n,$ in this paper we show that the conditions listed below are characterized exactly in terms of the so-called {\em tangency variety} of $f$ on $S$: (i) The $f$ is bounded from below on $S;$ (ii) The … Read more

    Subdifferentials and SNC property of scalarization functionals with uniform level sets and applications

  • Christiane Tammer
  • Bao Q. Truong
    • Categories Constrained Nonlinear Optimization, Multi-Criteria Optimization, Nonsmooth Optimization

    This paper deals with necessary conditions for minimal solutions of constrained and unconstrained optimization problems with respect to general domination sets by using a well-known nonlinear scalarization functional with uniform level sets (called Gerstewitz’ functional in the literature). The primary objective of this work is to establish revised formulas for basic and singular subdifferentials of … Read more

    Active-set Newton methods and partial smoothness

  • Adrian Lewis
  • Calvin Wylie
    • Categories Complementarity and Variational Inequalities, Constrained Nonlinear Optimization, Nonsmooth Optimization Tags , ,

    Diverse optimization algorithms correctly identify, in finite time, intrinsic constraints that must be active at optimality. Analogous behavior extends beyond optimization to systems involving partly smooth operators, and in particular to variational inequalities over partly smooth sets. As in classical nonlinear programming, such active-set structure underlies the design of accelerated local algorithms of Newton type. … Read more

    When a maximal angle among cones is nonobtuse

  • Michael Orlitzky
    • Categories Constrained Nonlinear Optimization, Optimization Software and Modeling Systems Tags , , , ,

    Principal angles between linear subspaces have been studied for their application to statistics, numerical linear algebra, and other areas. In 2005, Iusem and Seeger defined critical angles within a single convex cone as an extension of antipodality in a compact set. Then, in 2016, Seeger and Sossa extended that notion to two cones. This was … Read more

    Towards an efficient Augmented Lagrangian method for convex quadratic programming

  • Luís Felipe Bueno
  • Gabriel Haeser
  • Luiz-Rafael Santos
    • Categories Constrained Nonlinear Optimization, Linear Programming, Quadratic Programming Tags , , , ,

    Interior point methods have attracted most of the attention in the recent decades for solving large scale convex quadratic programming problems. In this paper we take a different route as we present an augmented Lagrangian method for convex quadratic programming based on recent developments for nonlinear programming. In our approach, box constraints are penalized while … Read more

    Forecasting conceivable interest rate market scenarios and significant losses on interest rate portfolios using mathematical optimization

  • Katsuhiro Tanaka
    • Categories Constrained Nonlinear Optimization, Finance and Economics Tags , , , , ,

    This study proposes a mathematical optimization programming model that simultaneously forecasts interest rate market scenarios and significant losses on interest rate market portfolios. The model includes three main components. A constraint condition is set using the Mahalanobis distance, which consists of innovation terms in a dynamic conditional correlation-generalized autoregressive conditional heteroscedasticity (DCC-GARCH) model that represent … Read more

    Intersection disjunctions for reverse convex sets

  • James R. Luedtke
  • Eli Towle
    • Categories (Mixed) Integer Nonlinear Programming, Constrained Nonlinear Optimization, Global Optimization Theory Tags , , , ,

    We present a framework to obtain valid inequalities for optimization problems constrained by a reverse convex set, which is defined as the set of points in a polyhedron that lie outside a given open convex set. We are particularly interested in cases where the closure of the convex set is either non-polyhedral, or is defined … Read more

    On High-order Model Regularization for Multiobjective Optimization

  • L. Calderón
  • Maria A. Diniz-Ehrhardt
  • José Mario Martínez
    • Categories Constrained Nonlinear Optimization Tags , ,

    A p-order regularization method for finding weak stationary points of multiobjective optimization problems with constraints is introduced. Under Holder conditions on the derivatives of the objective functions, complexity results are obtained that generalize properties recently proved for scalar optimization. ArticleDownload View PDF