Topics in semidefinite and interior-point methods
The articles of this volume will be reviewed individually. Indexed articles: \textit{Shapiro, Alexander}, Optimality conditions and sensitivity analysis of cone-constrained and semi-definite programs, 1-15 [Zbl 0903.90130] \textit{Porkolab, Lorant; Khachiyan, Leonid}, Testing the feasibility of semidefinite programs, 17-26 [Zbl 0906.90123] \textit{Ramana, Motakuri V.}, Polyhedra, spectrahedra, and semidefinite programming, 27-38 [Zbl 0906.90158] \textit{Faybusovich, Leonid}, Infinite-dimensional semidefinite programming: Regularized determinants and self-concordant barriers, 39-49 [Zbl 0906.90139] \textit{Laurent, Monique}, A tour d'horizon on positive semidefinite and Euclidean distance matrix completion problems, 51-76 [Zbl 0906.05074] \textit{Karisch, Stefan E.; Rendl, Franz}, Semidefinite programming and graph equipartition, 77-95 [Zbl 0905.90171] \textit{Johnson, Charles R.; Kroschel, Brenda K.; Lundquist, Michael}, The totally nonnegative completion problem, 97-107 [Zbl 0902.15012] \textit{Gu, Jun}, The Multi-SAT algorithm, 109-126 [Zbl 0902.68094] \textit{Emamy-K., M. Reza}, How efficiently can we maximize threshold pseudo-Boolean functions?, 127-135 [Zbl 0911.90260] \textit{Xue, Guoliang; Du, Ding-Zhu; Hwang, Frank K.}, Faster algorithm for shortest network under given topology, 137-152 [Zbl 0905.90172] \textit{Mockus, Audris; Mockus, Jonas; Mockus, Linas}, Bayesian Heuristic Approach (BHA) and applications to discrete optimization, 153-165 [Zbl 0905.90143] \textit{Mirkin, Boris}, Approximation clustering: A mine of semidefinite programming problems, 167-180 [Zbl 0903.90177] \textit{Anstreicher, Kurt M.; Fampa, Marcia}, A long-step path following algorithm for semidefinite programming problems, 181-196 [Zbl 0903.90126] \textit{Helmberg, Christoph; Weismantel, Robert}, Cutting plane algorithms for semidefinite relaxations, 197-213 [Zbl 0903.90122] \textit{de Klerk, E.; Roos, C.; Terlaky, T.}, Infeasible-start semidefinite programming algorithms via self-dual embeddings, 215-236 [Zbl 0905.90155] \textit{Lucidi, Stefano; Palagi, Laura}, Solution of the trust region problem via a smooth unconstrained reformulation, 237-250 [Zbl 0905.90158]
- 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
- 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)
