Semidefinite optimization
From MaRDI portal
Publication:3413756
DOI10.1017/S0962492901000071zbMath1105.65334OpenAlexW4243539849WikidataQ98060319 ScholiaQ98060319MaRDI QIDQ3413756
Publication date: 18 December 2006
Published in: Acta Numerica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0962492901000071
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Credible autocoding of convex optimization algorithms, Embedding methods for semidefinite programming, Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming, Fast implementation for semidefinite programs with positive matrix completion, A SemiSmooth Newton Method for Semidefinite Programs and its Applications in Electronic Structure Calculations, The spectral bundle method with second-order information, Unnamed Item, The interior-point revolution in optimization: History, recent developments, and lasting consequences, A fixed-point method for approximate projection onto the positive semidefinite cone, A solution method for combined semi-infinite and semi-definite programming, Spectral operators of matrices, Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: iterative process, Evaluating approximations of the semidefinite cone with trace normalized distance, Identifying a Set of Key Members in Social Networks Using SDP-Based Stochastic Search and Integer Programming Algorithms, A primal-dual interior-point method based on various selections of displacement step for symmetric optimization, Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods, Distance to a constitutive tensor isotropy stratum by the Lasserre polynomial optimization method, An equivalent nonlinear optimization model with triangular low-rank factorization for semidefinite programs, Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates, On the complexity of analyticity in semi-definite optimization, Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming, Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases, Projectively and Weakly Simultaneously Diagonalizable Matrices and their Applications, Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming, Lagrangian duality in convex conic programming with simple proofs, Solving Partial Differential Equations on Manifolds From Incomplete Interpoint Distance, Real Radicals and Finite Convergence of Polynomial Optimization Problems, Bad Semidefinite Programs: They All Look the Same, Convergence of a weighted barrier algorithm for stochastic convex quadratic semidefinite optimization, Antenna array synthesis with clusters of unmanned aerial vehicles, Actuarial Risk Matrices: The Nearest Positive Semidefinite Matrix Problem, Unnamed Item, Computing bounds on the expected payoff of Alternative Risk Transfer products, A guide to conic optimisation and its applications, An SQP-type algorithm for nonlinear second-order cone programs, A framework for solving mixed-integer semidefinite 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, Unnamed Item, Primal interior-point decomposition algorithms for two-stage stochastic extended second-order cone programming, A class of polynomial volumetric barrier decomposition algorithms for stochastic semidefinite programming, Robust portfolio asset allocation and risk measures, An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity, Stabilization of interconnected dynamical systems by online convex optimization, Approximation of the joint spectral radius using sum of squares, A semidefinite programming heuristic for quadratic programming problems with complementarity constraints, Robust portfolio asset allocation and risk measures, Preprocessing and Regularization for Degenerate Semidefinite Programs, Foundations of Set-Semidefinite Optimization, 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, Two Results on the Size of Spectrahedral Descriptions, A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors, Semidefinite programming relaxations and algebraic optimization in control, Noncommutative polynomials nonnegative on a variety intersect a convex set, Alternative SDP and SOCP approximations for polynomial optimization, A computational framework of gradient flows for general linear matrix equations, Convergence analysis of a nonlinear Lagrangian method for nonconvex semidefinite programming with subproblem inexactly solved, Block Coordinate Descent Methods for Semidefinite Programming, Reformulations in Mathematical Programming: Definitions and Systematics, Optimality conditions and global convergence for nonlinear semidefinite programming, Conic relaxation approaches for equal deployment problems, Scalable Low-Rank Semidefinite Programming for Certifiably Correct Machine Perception, A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems, Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian, A projected gradient method for optimization over density matrices, Spectral bounds for the maximum cut problem, NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials, On solving a class of linear semi-infinite programming by SDP method, STABLE – a stability algorithm for parametric model reduction by matrix interpolation, Optimization in High Dimensions via Accelerated, Parallel, and Proximal Coordinate Descent, A sequential quadratic penalty method for nonlinear semidefinite programming, A sequential quadratic penalty method for nonlinear semidefinite programming, Book Review: The basic George B. Dantzig, Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs, Exact Duality in Semidefinite Programming Based on Elementary Reformulations, A relaxed logarithmic barrier method for semidefinite programming, An inexact dual logarithmic barrier method for solving sparse 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, Sequences with minimal time-frequency uncertainty, On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate, On saddle points in semidefinite optimization via separation scheme, Semidefinite inverse eigenvalue problems with prescribed entries and partial eigendata, On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization, A quantum interior-point predictor–corrector algorithm for linear programming, On Polyhedral Approximations of the Positive Semidefinite Cone, Optimality conditions for nonsmooth semidefinite programming via convexificators, Data dissemination and disclosure limitation in a world without microdata: a risk-utility framework for remote access analysis servers, An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions, Douglas-Rachford splitting method for semidefinite programming, Two optimal value functions in parametric conic linear programming, Sufficient optimality conditions hold for almost all nonlinear semidefinite programs, 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, DC semidefinite programming and cone constrained DC optimization. I: Theory, Generating cutting planes for the semidefinite relaxation of quadratic programs, Stochastic semidefinite programming: a new paradigm for stochastic optimization, The saddle point problem of polynomials, Constraint consensus methods for finding strictly feasible points of linear matrix inequalities, Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials, 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, A homotopy method for nonlinear semidefinite programming, On the complexity of Putinar's Positivstellensatz, Facial reduction algorithms for conic optimization problems, Stochastic nuclear outages semidefinite relaxations, Optimization under uncertainty with applications to design of truss structures, Optimal design of multi-response experiments using semi-definite programming, Solving \(k\)-cluster problems to optimality with semidefinite programming, On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming, Strong duality and minimal representations for cone optimization, Polynomial time solvability of non-symmetric semidefinite programming, A semidefinite programming approach to a cross-intersection problem with measures, An augmented Lagrangian dual optimization approach to the \(H\)-weighted model updating problem, Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs, Homogeneous self-dual algorithms for stochastic semidefinite programming, Statistical inference of semidefinite programming with multiple parameters, Alternating direction augmented Lagrangian methods for semidefinite programming, An equivalency condition of nonsingularity in nonlinear semidefinite programming, Global stability analysis of fluid flows using sum-of-squares, Abstract interpretation meets convex optimization, The triple distribution of codes and ordered codes, Inexact SA method for constrained stochastic convex SDP and application in Chinese stock market, Computational geometry of positive definiteness, Location-aided routing with uncertainty in mobile ad hoc networks: a stochastic semidefinite programming approach, Alternating direction method of multipliers for sparse principal component analysis, An interior point method with a primal-dual quadratic barrier penalty function for nonlinear semidefinite programming, Robust control of uncertain systems: classical results and recent developments, A statistical learning theory approach for uncertain linear and bilinear matrix inequalities, Characterization of the dual problem of linear matrix inequality for H-infinity output feedback control problem via facial reduction, Homogeneous self-dual algorithms for stochastic second-order cone programming, Extension of the LP-Newton method to conic programming problems via semi-infinite representation, A filter method for nonlinear semidefinite programming with global convergence, The \(\mathcal A\)-truncated \(K\)-moment problem, On the sensitivity of the optimal partition for parametric second-order conic optimization, Uniform LP duality for semidefinite and semi-infinite programming, Numerical algebraic geometry and semidefinite programming, A homotopy method based on penalty function for nonlinear semidefinite programming, A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion, Negative features of hyperbolic and directional distance models for technologies with undesirable outputs, Numerical invariants through convex relaxation and max-strategy iteration, Reduced vertex set result for interval semidefinite optimization problems, The Russell measure model: computational aspects, duality, and profit efficiency, Largest dual ellipsoids inscribed in dual cones, Strong stationarity for optimization problems with complementarity constraints in absence of polyhedricity. With applications to optimization with semidefinite and second-order-cone complementarity constraints, Duality and profit efficiency for the hyperbolic measure model, Stochastic second-order cone programming: applications models, Semi-definite programming techniques for structured quadratic inverse eigenvalue problems, An admissible dual internal point method for a linear semidefinite programming problem, Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods, Conic systems and sublinear mappings: equivalent approaches., Uncertain convex programs: randomized solutions and confidence levels, A preliminary set of applications leading to stochastic semidefinite programs and chance-constrained semidefinite programs, A primal-dual interior point method for nonlinear semidefinite programming, Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming, Solutions to quadratic minimization problems with box and integer constraints, Perturbation analysis of singular semidefinite programs and its applications to control problems, T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming, A proximal DC approach for quadratic assignment problem, Polyhedral approximations of the semidefinite cone and their application, 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, A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization, Bounds for codes by semidefinite programming, Solving 0-1 semidefinite programs for distributionally robust allocation of surgery blocks, Invitation to intersection problems for finite sets, Sums of Hermitian squares and the BMV conjecture, Central paths in semidefinite programming, generalized proximal-point method and Cauchy trajectories in Riemannian manifolds, Smaller SDP for SOS decomposition, 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, A semidefinite programming approach for the projection onto the cone of negative semidefinite symmetric tensors with applications to solid mechanics, On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization, Second-order cone and semidefinite methods for the bisymmetric matrix approximation problem, Successive linearization methods for nonlinear semidefinite programs, Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: Newton's system of equations, Advances in computational Lyapunov analysis using sum-of-squares 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
