Semidefinite optimization
From MaRDI portal
Publication:3413756
DOI10.1017/S0962492901000071zbMath1105.65334WikidataQ98060319 ScholiaQ98060319MaRDI QIDQ3413756
Publication date: 18 December 2006
Published in: Acta Numerica (Search for Journal in Brave)
65K05: Numerical mathematical programming methods
90C22: Semidefinite programming
90C46: Optimality conditions and duality in mathematical programming
Related Items
A sequential quadratic penalty method for nonlinear semidefinite programming, A sequential quadratic penalty method for nonlinear semidefinite programming, The interior-point revolution in optimization: History, recent developments, and lasting consequences, A solution method for combined semi-infinite and semi-definite programming, Foundations of Set-Semidefinite Optimization, Robust portfolio asset allocation and risk measures, Polynomial time solvability of non-symmetric semidefinite programming, Alternating direction augmented Lagrangian methods for semidefinite programming, Conic systems and sublinear mappings: equivalent approaches., A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization, Bounds for codes by semidefinite programming, Successive linearization methods for nonlinear semidefinite programs, Data dissemination and disclosure limitation in a world without microdata: a risk-utility framework for remote access analysis servers, Semidefinite programming and sums of Hermitian squares of noncommutative polynomials, Copositive programming motivated bounds on the stability and the chromatic numbers, LMI approach to robust model predictive control, Stochastic semidefinite programming: a new paradigm for stochastic optimization, Universal duality in conic convex optimization, A matrix generation approach for eigenvalue optimization, Large-scale semidefinite programs in electronic structure calculation, Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling, On the complexity of Putinar's Positivstellensatz, Uniform LP duality for semidefinite and semi-infinite programming, Reduced vertex set result for interval semidefinite optimization problems, Largest dual ellipsoids inscribed in dual cones, Semi-definite programming techniques for structured quadratic inverse eigenvalue problems, Solutions to quadratic minimization problems with box and integer constraints, A globally convergent non-interior point algorithm with full Newton step for second-order cone programming, Parameter estimation with expected and residual-at-risk criteria, Sums of Hermitian squares and the BMV conjecture, Central paths in semidefinite programming, generalized proximal-point method and Cauchy trajectories in Riemannian manifolds, A geometric characterization of ``optimality-equivalent relaxations, Third-order extensions of Lo's semiparametric bound for European call options, On the convergence of the entropy-exponential penalty trajectories and generalized proximal point methods in semidefinite optimization, Stochastic second-order cone programming in mobile ad hoc networks, Commutative association schemes, Exploiting special structure in semidefinite programming: a survey of theory and applications, On filter-successive linearization methods for nonlinear semidefinite programming, Two numerical methods for optimizing matrix stability, Detecting a definite Hermitian pair and a hyperbolic or elliptic quadratic eigenvalue problem, and associated nearness problems, Uncertain convex programs: randomized solutions and confidence levels, An SQP-type algorithm for nonlinear second-order cone programs, A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions, Robust portfolio selection with uncertain exit time using worst-case VaR strategy, A semidefinite programming-based heuristic for graph coloring, Approximation of the joint spectral radius using sum of squares, A semidefinite programming heuristic for quadratic programming problems with complementarity constraints, A relaxed cutting plane method for semi-infinite semi-definite programming, Fast linear iterations for distributed averaging, Approximate augmented Lagrangian functions and nonlinear semidefinite programs, LFTB: an efficient algorithm to bound linear fractional transformations, Sufficient global optimality conditions for multi-extremal smooth minimisation problems with bounds and linear matrix inequality constraints, Unnamed Item, Reformulations in Mathematical Programming: Definitions and Systematics, Spectral bounds for the maximum cut problem
