Ellen H. Fukuda

On the weak second-order optimality condition for nonlinear semidefinite and second-order cone programming

  • Ellen H. Fukuda
  • Gabriel Haeser
  • Leonardo M. Mito
    • Categories Linear, Cone and Semidefinite Programming, Second-Order Cone Programming, Semi-definite Programming Tags , ,

    Second-order necessary optimality conditions for nonlinear conic programming problems that depend on a single Lagrange multiplier are usually built under nondegeneracy and strict complementarity. In this paper we establish a condition of such type for two classes of nonlinear conic problems, namely semidefinite and second-order cone programming, assuming Robinson’s constraint qualification and a generalized form … Read more

    A conjugate directions-type procedure for quadratic multiobjective optimization

  • Ellen H. Fukuda
  • L. M. Graña Drummond
  • Ariane M. Masuda
    • Categories Multi-Criteria Optimization

    We propose an extension of the real-valued conjugate directions method for unconstrained quadratic multiobjective problems. As in the single-valued counterpart, the procedure requires a set of directions that are simultaneously conjugate with respect to the positive definite matrices of all quadratic objective components. Likewise, the multicriteria version computes the steplength by means of the unconstrained … Read more

    On the use of Jordan Algebras for improving global convergence of an Augmented Lagrangian method in nonlinear semidefinite programming

  • Roberto Andreani
  • Ellen H. Fukuda
  • Gabriel Haeser
  • Daiana O. Santos
  • Leonardo D. Secchin
    • Categories Nonlinear Optimization, Semi-definite Programming Tags , , , ,

    Jordan Algebras are an important tool for dealing with semidefinite programming and optimization over symmetric cones in general. In this paper, a judicious use of Jordan Algebras in the context of sequential optimality conditions is done in order to generalize the global convergence theory of an Augmented Lagrangian method for nonlinear semidefinite programming. An approximate … Read more

    Optimality conditions for nonlinear second-order cone programming and symmetric cone programming

  • Roberto Andreani
  • Ellen H. Fukuda
  • Gabriel Haeser
  • Daiana O. Santos
  • Leonardo D. Secchin
    • Categories Linear, Cone and Semidefinite Programming, Nonlinear Optimization, Second-Order Cone Programming Tags , , , ,

    Nonlinear symmetric cone programming (NSCP) generalizes important optimization problems such as nonlinear programming, nonlinear semidefinite programming and nonlinear second-order cone programming (NSOCP). In this work, we present two new optimality conditions for NSCP without constraint qualifications, which implies the Karush-Kuhn-Tucker conditions under a condition weaker than Robinson’s constraint qualification. In addition, we show the relationship … Read more

    Nonmonotone line searches for unconstrained multiobjective optimization problems

  • Ellen H. Fukuda
  • Kanako Mita
  • Nobuo Yamashita
    • Categories Multi-Criteria Optimization, Unconstrained Optimization Tags , , , ,

    In the last two decades, many descent methods for multiobjective optimization problems were proposed. In particular, the steepest descent and the Newton methods were studied for the unconstrained case. In both methods, the search directions are computed by solving convex subproblems, and the stepsizes are obtained by an Armijo-type line search. As a consequence, the … Read more

    A barrier-type method for multiobjective optimization

  • Ellen H. Fukuda
  • L. M. Graña Drummond
  • Fernanda M. P. Raupp
    • Categories Multi-Criteria Optimization Tags , , ,

    For solving constrained multicriteria problems, we introduce the multiobjective barrier method (MBM), which extends the scalar-valued internal penalty method. This multiobjective version of the classical method also requires a penalty barrier for the feasible set and a sequence of nonnegative penalty parameters. Differently from the single-valued procedure, MBM is implemented by means of an auxiliary … Read more

    Exact augmented Lagrangian functions for nonlinear semidefinite programming

  • Ellen H. Fukuda
  • Bruno F. Lourenço
    • Categories Constrained Nonlinear Optimization, Semi-definite Programming Tags , ,

    In this paper, we study augmented Lagrangian functions for nonlinear semidefinite programming (NSDP) problems with exactness properties. The term exact is used in the sense that the penalty parameter can be taken appropriately, so a single minimization of the augmented Lagrangian recovers a solution of the original problem. This leads to reformulations of NSDP problems … Read more

    Optimality conditions for problems over symmetric cones and a simple augmented Lagrangian method

  • Ellen H. Fukuda
  • Bruno F. Lourenço
  • Masao Fukushima
    • Categories Linear, Cone and Semidefinite Programming, Nonlinear Optimization Tags , ,

    In this work we are interested in nonlinear symmetric cone problems (NSCPs), which contain as special cases nonlinear semidefinite programming, nonlinear second order cone programming and the classical nonlinear programming problems. We explore the possibility of reformulating NSCPs as common nonlinear programs (NLPs), with the aid of squared slack variables. Through this connection, we show … Read more

    A note on the squared slack variables technique for nonlinear optimization

  • Ellen H. Fukuda
  • Masao Fukushima
    • Categories Constrained Nonlinear Optimization Tags , , ,

    In constrained nonlinear optimization, the squared slack variables can be used to transform a problem with inequality constraints into a problem containing only equality constraints. This reformulation is usually not considered in the modern literature, mainly because of possible numerical instabilities. However, this argument only concerns the development of algorithms, and nothing stops us in … Read more

    The use of squared slack variables in nonlinear second-order cone programming

  • Ellen H. Fukuda
  • Masao Fukushima
    • Categories Nonlinear Optimization, Second-Order Cone Programming Tags , , ,

    In traditional nonlinear programming, the technique of converting a problem with inequality constraints into a problem containing only equality constraints, by the addition of squared slack variables, is well-known. Unfortunately, it is considered to be an avoided technique in the optimization community, since the advantages usually do not compensate for the disadvantages, like the increase … Read more