Topics in semidefinite and interior-point methods
From MaRDI portal
Recommendations
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- An Interior-Point Method for Semidefinite Programming
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- scientific article; zbMATH DE number 1069182
- Interior-point algorithms for semi-infinite programming
- scientific article; zbMATH DE number 1889340
- Interior-point methods for convex programming
- scientific article; zbMATH DE number 2246591
- Theoretical and algorithmic aspects in semi-definite optimization
- scientific article; zbMATH DE number 1047680
Cited in
(24)- New optimality conditions for quadratic optimization problems with binary constraints
- Global optimization of polynomial-expressed nonlinear optimal control problems with semidefinite programming relaxation
- On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming
- Dual fast projected gradient method for quadratic programming
- Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems
- 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
- A method for semidefinite quasiconvex maximization problem
- Robust solutions to multi-facility Weber location problem under interval and ellipsoidal uncertainty
- Optimality conditions in semidefinite programming
- scientific article; zbMATH DE number 1506371 (Why is no real title available?)
- On duality gap in binary quadratic programming
- Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs
- Second-order cone programming approaches to static shakedown analysis in steel plasticity
- Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices
- Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
- A regularized strong duality for nonsymmetric semidefinite least squares problem
- An O( nL) iteration primal-dual second-order corrector algorithm for linear programming
- Alternating direction method for bi-quadratic programming
- Improved smoothing Newton methods for symmetric cone complementarity problems
- Inexact non-interior continuation method for monotone semidefinite complementarity problems
- 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
This page was built for publication: Topics in semidefinite and interior-point methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1386876)