Aspects of semidefinite programming. Interior point algorithms and selected applications
From MaRDI portal
Publication:1597978
zbMath0991.90098MaRDI QIDQ1597978
Publication date: 29 May 2002
Published in: Applied Optimization (Search for Journal in Brave)
semidefinite programminginterior point methodslogarithmic barrier methodspath-following methodsprimal-dual affine-scaling methods
Semidefinite programming (90C22) Interior-point methods (90C51) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
An predictor–corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood, A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization, Full Nesterov–Todd step feasible interior-point method for the CartesianP*(κ)-SCLCP, Some Recent Developments in Spectrahedral Computation, Limiting behavior of the central path in semidefinite optimization, Minimizer Extraction in Polynomial Optimization Is Robust, Simultaneous Diagonalization via Congruence of Hermitian Matrices: Some Equivalent Conditions and a Numerical Solution, New complexity analysis of a full Nesterov–Todd step interior-point method for semidefinite optimization, Symmetric Kronecker Products and Semiclassical Wave Packets, A wide neighbourhood primal-dual second-order corrector interior point algorithm for semidefinite optimization, Efficient decoupling schemes for multiscale multicontinuum problems in fractured porous media, Corrector-predictor interior-point method with new search direction for semidefinite optimization, Asymptotic Floquet states of open quantum systems: the role of interaction, A class of new search directions for full-NT step feasible interior point method in semidefinite optimization, A full NT-step infeasible interior-point algorithm for semidefinite optimization, New Interior-Point Algorithm for Symmetric Optimization Based on a Positive-Asymptotic Barrier Function, A Mehrotra predictor-corrector interior-point algorithm for semidefinite optimization, A new full-NT step interior-point method for circular cone optimization, A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions, Refining the partition for multifold conic optimization problems, Simplified analysis for full-Newton step infeasible interior-point algorithm for semidefinite programming, H∞filter design for continuous-time systems with quantised signals, Application of facial reduction to H ∞ state feedback control problem, A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions, Preprocessing and Regularization for Degenerate Semidefinite Programs, Unnamed Item, A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors, Constrained trace-optimization of polynomials in freely noncommuting variables, Semidefinite relaxations for partitioning, assignment and ordering problems, Time-Varying Semidefinite Programs, Parametric analysis of semidefinite optimization, A Matrix Positivstellensatz with Lifting Polynomials, Semidefinite relaxations for partitioning, assignment and ordering problems, An extension for identifying search directions for interior-point methods in linear optimization, Examples for the quantum Kippenhahn theorem, A new wide neighbourhood primal-dual interior-point algorithm for semidefinite optimization, A primal-dual interior-point method based on a new kernel function for linear complementarity problem, A Semidefinite Hierarchy for Containment of Spectrahedra, On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate, Preservers of partial orders on the set of all variance-covariance matrices, On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization, Unnamed Item, Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier, Embedding methods for semidefinite programming, Matrix Relaxations in Combinatorial Optimization, Manifold valued data analysis of samples of networks, with applications in corpus linguistics, Sufficient optimality conditions hold for almost all nonlinear semidefinite programs, A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization, An alternative theorem for set-valued maps via set relations and its application to robustness of feasible sets, Optimal Counterfeiting Attacks and Generalizations for Wiesner’s Quantum Money, Copositive programming motivated bounds on the stability and the chromatic numbers, \(H_\infty\) control and \(\varepsilon\)-bound estimation of discrete-time singularly perturbed systems, Multihazard design: Structural optimization approach, On verified numerical computations in convex programming, Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem, A second-order Mehrotra-type predictor-corrector algorithm with a new wide neighbourhood for semi-definite programming, Stability and performance analysis of hybrid integrator-gain systems: a linear matrix inequality approach, On the derivation of mean-field percolation critical exponents from the triangle condition, Unnamed Item, A homotopy method for nonlinear semidefinite programming, On the maximization of the fundamental eigenvalue in topology optimization, Complexity analysis of a full-{N}ewton step interior-point method for linear optimization, \(H_{\infty}\) control for networked control systems with limited communication, Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: iterative process, A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization, Minimizing the sum of linear fractional functions over the cone of positive semidefinite matrices: approximation and applications, Convex approximations in stochastic programming by semidefinite programming, A new second-order corrector interior-point algorithm for semidefinite programming, An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization, A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization, Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step, Exact SDP relaxations for classes of nonlinear semidefinite programming problems, A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions, A note on star partial order preservers on the set of all variance-covariance matrices, Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs, A simplified treatment of Ramana's exact dual for semidefinite programming, Optimality theorems for convex semidefinite vector optimization problems, On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function, A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization, A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO, Full Nesterov-Todd step infeasible interior-point method for symmetric optimization, Control design for a class of nonlinear continuous-time systems, On the extension of an arc-search interior-point algorithm for semidefinite optimization, Dimensionality reduction of SDPs through sketching, Primal-dual interior-point algorithm for convex quadratic semi-definite optimization, A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood, Reduction of SISO H-infinity output feedback control problem, A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization, Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function, Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization, A polynomial time constraint-reduced algorithm for semidefinite optimization problems, 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, Sums of squares based approximation algorithms for MAX-SAT, \(\mathcal{UV}\)-theory of a class of semidefinite programming and its applications, On semidefinite least squares and minimal unsatisfiability, An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization, A new graph parameter related to bounded rank positive semidefinite matrix completions, Interior Point Methods for Nonlinear Optimization, A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems, Conic programming: infeasibility certificates and projective geometry, An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming, On the volumetric path, Global minimization of rational functions and the nearest GCDs, Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term, A parallel interior point decomposition algorithm for block angular semidefinite programs, Asymptotic behavior of the central path for a special class of degenerate SDP problems, An admissible dual internal point method for a linear semidefinite programming problem, On self-regular IPMs (with comments and rejoinder), Feasibility and solvability of Lyapunov-type linear programming over symmetric cones, An efficient parameterized logarithmic kernel function for semidefinite optimization, A convex optimisation framework for the unequal-areas facility layout problem, State feedback design for input-saturating quadratic systems, Perturbation analysis of singular semidefinite programs and its applications to control problems, A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization, An infeasible interior point method for the monotone SDLCP based on a transformation of the central path, Robust stability of polytopic time-inhomogeneous Markov jump linear systems, Noncommutative polynomials nonnegative on a variety intersect a convex set, Introduction to Semidefinite, Conic and Polynomial Optimization, The Approach of Moments for Polynomial Equations, A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step, A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization, Direct Newton method for a linear problem of semidefinite programming, An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood, A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization, A new primal-dual path-following interior-point algorithm for semidefinite optimization, Kernel-function Based Algorithms for Semidefinite Optimization, A new barrier for a class of semidefinite problems, A new second-order Mehrotra-type predictor-corrector algorithm for SDO, A primal-dual interior-point algorithm with arc-search for semidefinite programming, Hybrid Newmark-conformal FDTD modeling of thin spoof plasmonic metamaterials, A prolongation-projection algorithm for computing the finite real variety of an ideal, Semidefinite characterization and computation of zero-dimensional real radical ideals, \(l_2\) Induced norm analysis of discrete-time LTI systems for nonnegative input signals and its application to stability analysis of recurrent neural networks, Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function, 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, An inexact dual logarithmic barrier method for solving sparse semidefinite programs, Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization, New complexity analysis of a Mehrotra-type predictor–corrector algorithm for semidefinite programming, Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term, Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: Newton's system of equations
Uses Software
