Pages that link to "Item:Q5915427"

The following pages link to Handbook of semidefinite programming. Theory, algorithms, and applications (Q5915427):

Displaying 50 items.

• A dynamic inequality generation scheme for polynomial programming (Q263184) (← links)
• A search for quantum coin-flipping protocols using optimization techniques (Q263220) (← links)
• Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
• On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods (Q359624) (← links)
• Stochastic nuclear outages semidefinite relaxations (Q373211) (← links)
• A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization (Q378264) (← links)
• A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization (Q394386) (← links)
• An efficient DC programming approach for portfolio decision with higher moments (Q409263) (← links)
• Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step (Q411535) (← links)
• Generating and improving orthogonal designs by using mixed integer programming (Q420882) (← links)
• New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs (Q425803) (← links)
• Optimality theorems for convex semidefinite vector optimization problems (Q425863) (← links)
• Global stability analysis of fluid flows using sum-of-squares (Q429219) (← links)
• Market price-based convex risk measures: a distribution-free optimization approach (Q435754) (← links)
• Polynomials with and without determinantal representations (Q445815) (← links)
• On duality gap in binary quadratic programming (Q454277) (← links)
• An interior point method with a primal-dual quadratic barrier penalty function for nonlinear semidefinite programming (Q457716) (← links)
• On Farkas lemma and dimensional rigidity of bar frameworks (Q498344) (← links)
• A semidefinite programming study of the Elfving theorem (Q546096) (← links)
• A preliminary set of applications leading to stochastic semidefinite programs and chance-constrained semidefinite programs (Q554728) (← links)
• Alternating direction augmented Lagrangian methods for semidefinite programming (Q621749) (← links)
• An equivalency condition of nonsingularity in nonlinear semidefinite programming (Q625675) (← links)
• Proper analytic free maps (Q629717) (← links)
• A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO (Q634734) (← links)
• Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients (Q654030) (← links)
• A feasible direction method for the semidefinite program with box constraints (Q654206) (← links)
• Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian (Q662288) (← links)
• A convex relaxation bound for subgraph isomorphism (Q666533) (← links)
• A cutting plane algorithm for semi-definite programming problems with applications to failure discriminant analysis (Q697556) (← links)
• Conic systems and sublinear mappings: equivalent approaches. (Q703260) (← links)
• Convex relaxations for mixed integer predictive control (Q710707) (← links)
• A primal-dual interior point method for nonlinear semidefinite programming (Q715092) (← links)
• An infeasible interior point method for the monotone SDLCP based on a transformation of the central path (Q721594) (← links)
• Sums of squares of polynomials with rational coefficients (Q726755) (← links)
• A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization (Q735073) (← links)
• Hyperbolic polynomials and generalized Clifford algebras (Q741604) (← links)
• Worst-case results for positive semidefinite rank (Q745690) (← links)
• Smaller SDP for SOS decomposition (Q746820) (← links)
• Construction of a class of sharp Löwner majorants for a set of symmetric matrices (Q778636) (← links)
• Duality theories in nonlinear semidefinite programming (Q812659) (← links)
• Inverse conic linear programs in Banach spaces (Q828644) (← links)
• Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs (Q837124) (← links)
• Sum of squares method for sensor network localization (Q839485) (← links)
• On a special class of regularized central paths for semidefinite programs (Q847845) (← links)
• Multihazard design: Structural optimization approach (Q848726) (← links)
• A survey for the quadratic assignment problem (Q852928) (← links)
• Stochastic semidefinite programming: a new paradigm for stochastic optimization (Q862822) (← links)
• A matrix generation approach for eigenvalue optimization (Q868452) (← links)
• Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems (Q868472) (← links)
• Properties of the augmented Lagrangian in nonlinear semidefinite optimization (Q868537) (← links)