A primal barrier function phase I algorithm for nonsymmetric conic optimization problems

DOI10.1007/s13160-012-0081-1zbMath1254.90156OpenAlexW2053017820MaRDI QIDQ1926650

Yasuaki Matsukawa, Akiko Yoshise

Publication date: 28 December 2012

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2241/118163

zbMATH Keywords

doubly nonnegative conenonsymmetric conic optimizationphase I algorithmprimal barrier functionself-concordant function

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25) Interior-point methods (90C51)

Related Items

Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints, Differential properties of Euclidean projection onto power cone, Unnamed Item, A note on strict complementarity for the doubly non-negative cone, A robust Lagrangian-DNN method for a class of quadratic optimization problems, A self-concordant exponential kernel function for primal–dual interior-point algorithm, On merit functions for \(p\)-order cone complementarity problem, Constructions of complementarity functions and merit functions for circular cone complementarity problem, Smaller SDP for SOS decomposition, A polynomial-time interior-point method for circular cone programming based on kernel functions, Variational analysis of circular cone programs, A nonmonotone smoothing Newton method for circular cone programming, Primal-dual interior-point algorithms for convex quadratic circular cone optimization

Uses Software

• QAPLIB

Cites Work

• QAPLIB-A quadratic assignment problem library
• Copositive and semidefinite relaxations of the quadratic assignment problem
• On the copositive representation of binary and continuous nonconvex quadratic programs
• Hyperbolic programs, and their derivative relaxations
• A Mathematical View of Interior-Point Methods in Convex Optimization
• Approximation of the Stability Number of a Graph via Copositive Programming
• Feasible and Accurate Algorithms for Covering Semidefinite Programs
• On Semidefinite Programming Relaxations of the Traveling Salesman Problem
• Hyperbolic Polynomials and Interior Point Methods for Convex Programming
• On Cones of Nonnegative Quadratic Functions
• On copositive programming and standard quadratic optimization problems