Chek Beng Chua

Superlinearly convergent smoothing Newton continuation algorithms for variational inequalities over definable sets

  • Chek Beng Chua
  • Le Thi Khanh Hien
    • Categories Complementarity and Variational Inequalities Tags , , ,

    In this paper, we use the concept of barrier-based smoothing approximations introduced by Chua and Li to extend various smoothing Newton continuation algorithms to variational inequalities over general closed convex sets X. We prove that when the underlying barrier has a gradient map that is definable in some o-minimal structure, the iterates generated converge superlinearly … Read more

    An inexact proximal bundle method with applications to convex conic programming

  • Chek Beng Chua
  • Huiling Lin
    • Categories Convex and Nonsmooth Optimization, Global Optimization Tags , , , ,

    We present an inexact bundle method for minimizing an unconstrained convex sup-function with an open domain. Under some mild assumptions, we reformulate a convex conic programming problem as such problem in terms of the support function. This method is a first-order method, hence it requires much less computational cost in each iteration than second-order approaches … Read more

    A barrier-based smoothing proximal point algorithm for NCPs over closed convex cones

  • Chek Beng Chua
  • Zhen Li
    • Categories Complementarity and Variational Inequalities, Convex Optimization Tags , , ,

    We present a new barrier-based method of constructing smoothing approximations for the Euclidean projector onto closed convex cones. These smoothing approximations are used in a smoothing proximal point algorithm to solve monotone nonlinear complementarity problems (NCPs) over a convex cones via the normal map equation. The smoothing approximations allow for the solution of the smoothed … Read more

    Target-following framework for symmetric cone programming

  • Chek Beng Chua
    • Categories Convex Optimization, Linear, Cone and Semidefinite Programming

    We extend the target map, together with the weighted barriers and the notions of weighted analytic centers, from linear programming to general convex conic programming. This extension is obtained from a novel geometrical perspective of the weighted barriers, that views a weighted barrier as a weighted sum of barriers for a strictly decreasing sequence of … Read more

    Uniform nonsingularity and complementarity problems over symmetric cones

  • Chek Beng Chua
  • Huiling Lin
  • Peng Yi
    • Categories Complementarity and Variational Inequalities Tags , , , ,

    We study the uniform nonsingularity property recently proposed by the authors and present its applications to nonlinear complementarity problems over a symmetric cone. In particular, by addressing theoretical issues such as the existence of Newton directions, the boundedness of iterates and the nonsingularity of B-subdifferentials, we show that the non-interior continuation method proposed by Xin … Read more

    A continuation method for nonlinear complementarity problems over symmetric cone

  • Chek Beng Chua
  • Peng Yi
    • Categories Complementarity and Variational Inequalities Tags , , , ,

    In this paper, we introduce a new P-type condition for nonlinear functions defined over Euclidean Jordan algebras, and study a continuation method for nonlinear complementarity problems over symmetric cones. This new P-type condition represents a new class of nonmonotone nonlinear complementarity problems that can be solved numerically. CitationResearch Report, Division of Mathematical Sciences, School of … Read more

    T-algebras and linear optimization over symmetric cones

  • Chek Beng Chua
    • Categories Convex Optimization, Linear, Cone and Semidefinite Programming

    Euclidean Jordan-algebra is a commonly used tool in designing interior point algorithms for symmetric cone programs. T-algebra, on the other hand, has rarely been used in symmetric cone programming. In this paper, we use both algebraic characterizations of symmetric cones to extend the target-following framework of linear programming to symmetric cone programming. Within this framework, … Read more

    A T-algebraic approach to primal-dual interior-point algorithms

  • Chek Beng Chua
    • Categories Convex Optimization, Linear, Cone and Semidefinite Programming

    Three primal-dual interior-point algorithms for homogeneous cone programming are presented. They are a short-step algorithm, a large-update algorithm, and a predictor-corrector algorithm. These algorithms are described and analyzed based on a characterization of homogeneous cone via T-algebra. The analysis show that the algorithms have polynomial iteration complexity. CitationDivision of Mathematical Sciences, Nanyang Technological University, December … Read more

    Target following algorithms for semidefinite programming

  • Chek Beng Chua
    • Categories Convex Optimization, Semi-definite Programming

    We present a target-following framework for semidefinite programming, which generalizes the target-following framework for linear programming. We use this framework to build weighted path-following interior-point algorithms of three distinct flavors: short-step, predictor-corrector, and large-update. These algorithms have worse-case iteration bounds that parallel their counterparts in linear programming. We further consider the problem of finding analytic … Read more

    Analyticity of weighted central path and error bound for semidefinite programming

  • Chek Beng Chua
    • Categories Convex Optimization, Semi-definite Programming Tags , , ,

    The purpose of this paper is two-fold. Firstly, we show that every Cholesky-based weighted central path for semidefinite programming is analytic under strict complementarity. This result is applied to homogeneous cone programming to show that the central paths defined by the known class of optimal self-concordant barriers are analytic in the presence of strictly complementary … Read more