Topics in semidefinite and interior-point methods
From MaRDI portal
Publication:1386876
zbMath0890.00019MaRDI QIDQ1386876
No author found.
Publication date: 27 May 1998
Published in: Fields Institute Communications (Search for Journal in Brave)
Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)
Related Items (23)
Robust solutions to multi-facility Weber location problem under interval and ellipsoidal uncertainty ⋮ A method for semidefinite quasiconvex maximization problem ⋮ Second-order cone programming approaches to static shakedown analysis in steel plasticity ⋮ Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems ⋮ Global optimization of polynomial-expressed nonlinear optimal control problems with semidefinite programming relaxation ⋮ On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming ⋮ Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints ⋮ Dual fast projected gradient method for quadratic programming ⋮ A regularized strong duality for nonsymmetric semidefinite least squares problem ⋮ An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming ⋮ On duality gap in binary quadratic programming ⋮ Alternating direction method for bi-quadratic programming ⋮ On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems ⋮ Second-order cone and semidefinite representations of material failure criteria ⋮ Improved smoothing Newton methods for symmetric cone complementarity problems ⋮ Inexact non-interior continuation method for monotone semidefinite complementarity problems ⋮ Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices ⋮ An algorithm for nonlinear optimization problems with binary variables ⋮ Exact penalty functions for nonlinear integer programming problems ⋮ Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems ⋮ New optimality conditions for quadratic optimization problems with binary constraints ⋮ Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs ⋮ Optimality Conditions in Semidefinite Programming
Uses Software
This page was built for publication: Topics in semidefinite and interior-point methods
