Pages that link to "Item:Q1597978"

The following pages link to Aspects of semidefinite programming. Interior point algorithms and selected applications (Q1597978):

Displaying 50 items.

• Sufficient optimality conditions hold for almost all nonlinear semidefinite programs (Q304224) (← links)
• \(H_\infty\) control and \(\varepsilon\)-bound estimation of discrete-time singularly perturbed systems (Q318268) (← links)
• A homotopy method for nonlinear semidefinite programming (Q360377) (← links)
• On the maximization of the fundamental eigenvalue in topology optimization (Q373895) (← links)
• \(H_{\infty}\) control for networked control systems with limited communication (Q389769) (← links)
• A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization (Q394386) (← links)
• Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step (Q411535) (← links)
• Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs (Q421275) (← links)
• Optimality theorems for convex semidefinite vector optimization problems (Q425863) (← links)
• On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function (Q425872) (← links)
• Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization (Q493059) (← links)
• A polynomial time constraint-reduced algorithm for semidefinite optimization problems (Q493064) (← links)
• A homotopy method based on penalty function for nonlinear semidefinite programming (Q496592) (← links)
• On semidefinite least squares and minimal unsatisfiability (Q516798) (← links)
• An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization (Q520262) (← links)
• A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions (Q627154) (← links)
• A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO (Q634734) (← links)
• Full Nesterov-Todd step infeasible interior-point method for symmetric optimization (Q635148) (← links)
• On the volumetric path (Q691484) (← links)
• Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term (Q695048) (← links)
• Feasibility and solvability of Lyapunov-type linear programming over symmetric cones (Q707872) (← links)
• An infeasible interior point method for the monotone SDLCP based on a transformation of the central path (Q721594) (← links)
• A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step (Q734862) (← links)
• A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization (Q735073) (← links)
• Direct Newton method for a linear problem of semidefinite programming (Q735655) (← links)
• Copositive programming motivated bounds on the stability and the chromatic numbers (Q847835) (← links)
• Multihazard design: Structural optimization approach (Q848726) (← links)
• On verified numerical computations in convex programming (Q849186) (← links)
• An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization (Q894428) (← links)
• A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization (Q905304) (← links)
• Primal-dual interior-point algorithm for convex quadratic semi-definite optimization (Q923998) (← links)
• Sums of squares based approximation algorithms for MAX-SAT (Q944728) (← links)
• A parallel interior point decomposition algorithm for block angular semidefinite programs (Q969720) (← links)
• State feedback design for input-saturating quadratic systems (Q987655) (← links)
• A new primal-dual path-following interior-point algorithm for semidefinite optimization (Q1014697) (← links)
• A prolongation-projection algorithm for computing the finite real variety of an ideal (Q1029340) (← links)
• Semidefinite characterization and computation of zero-dimensional real radical ideals (Q1029543) (← links)
• On the convergence of the entropy-exponential penalty trajectories and generalized proximal point methods in semidefinite optimization (Q1037353) (← links)
• Stochastic second-order cone programming in mobile ad hoc networks (Q1039371) (← links)
• Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier (Q1616941) (← links)
• Complexity analysis of a full-{N}ewton step interior-point method for linear optimization (Q1677554) (← links)
• On the extension of an arc-search interior-point algorithm for semidefinite optimization (Q1713225) (← links)
• Dimensionality reduction of SDPs through sketching (Q1713333) (← links)
• Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function (Q1733331) (← links)
• On self-regular IPMs (with comments and rejoinder) (Q1769946) (← links)
• Convex approximations in stochastic programming by semidefinite programming (Q1931652) (← links)
• A new second-order corrector interior-point algorithm for semidefinite programming (Q1935927) (← links)
• A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization (Q1937023) (← links)
• Exact SDP relaxations for classes of nonlinear semidefinite programming problems (Q1939707) (← links)
• Conic programming: infeasibility certificates and projective geometry (Q1996078) (← links)