Pages that link to "Item:Q4332255"

The following pages link to Barrier Functions in Interior Point Methods (Q4332255):

Displaying 50 items.

• A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones (Q306357) (← links)
• On bounds of the Pythagoras number of the sum of square magnitudes of Laurent polynomials (Q317123) (← links)
• A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming (Q378283) (← links)
• Convergence analysis of a regularized interior point algorithm for the barrier problems with singular solutions (Q393377) (← links)
• Existence and uniqueness of solutions for homogeneous cone complementarity problems (Q430953) (← links)
• A weighted-path-following method for symmetric cone linear complementarity problems (Q478931) (← links)
• A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming (Q493049) (← links)
• Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization (Q493059) (← links)
• An axiomatic duality framework for the theta body and related convex corners (Q517307) (← links)
• A polynomial primal-dual affine scaling algorithm for symmetric conic optimization (Q523579) (← links)
• \(L^{p}\)-norms, log-barriers and Cramer transform in optimization (Q618872) (← links)
• Inradius and circumradius of various convex cones arising in applications (Q618877) (← links)
• Full Nesterov-Todd step infeasible interior-point method for symmetric optimization (Q635148) (← links)
• The \(Q\) method for symmetric cone programming (Q639204) (← links)
• On convex optimization without convex representation (Q644504) (← links)
• Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones (Q650213) (← links)
• Reflection-projection method for convex feasibility problems with an obtuse cone (Q704736) (← links)
• A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization (Q743780) (← links)
• A polynomial-time interior-point method for circular cone programming based on kernel functions (Q747043) (← links)
• Centers and partial volumes of convex cones. II: Advanced topics (Q747570) (← links)
• Largest dual ellipsoids inscribed in dual cones (Q959981) (← links)
• Recursive construction of optimal self-concordant barriers for homogeneous cones (Q1016397) (← links)
• Numerical experiments with universal barrier functions for cones of Chebyshev systems (Q1029624) (← links)
• Characterization of the barrier parameter of homogeneous convex cones (Q1290599) (← links)
• Semidefinite programming and matrix scaling over the semidefinite cone. (Q1414710) (← links)
• Similarity and other spectral relations for symmetric cones (Q1573667) (← links)
• Self-scaled barrier functions on symmetric cones and their classification (Q1611095) (← links)
• Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier (Q1616941) (← links)
• Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions (Q1644105) (← links)
• A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy (Q1681807) (← links)
• Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions (Q1697897) (← links)
• Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones (Q1730771) (← links)
• An arc search infeasible interior-point algorithm for symmetric optimization using a new wide neighborhood (Q1731107) (← links)
• Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (Q1887719) (← links)
• Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones (Q1937004) (← links)
• A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization (Q1937023) (← links)
• Inscribed and circumscribed ellipsoidal cones: volume ratio analysis (Q1992190) (← links)
• A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization (Q2018491) (← links)
• Gaddum's test for symmetric cones (Q2022297) (← links)
• On self-concordant barriers for generalized power cones (Q2115322) (← links)
• Rank computation in Euclidean Jordan algebras (Q2133925) (← links)
• A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization (Q2149553) (← links)
• A convex optimization method to solve a filter design problem (Q2252696) (← links)
• A Schwarz lemma for Kähler affine metrics and the canonical potential of a proper convex cone (Q2255361) (← links)
• Centers and partial volumes of convex cones. I: Basic theory (Q2257001) (← links)
• A mathematical programming model for computing the fries number of a fullerene (Q2282646) (← links)
• A primal-dual interior-point algorithm for symmetric cone convex quadratic programming based on the commutative class directions (Q2316302) (← links)
• An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path (Q2361136) (← links)
• A primal-dual interior-point algorithm for symmetric optimization based on a new kernel function with trigonometric barrier term yielding the best known iteration bounds (Q2361520) (← links)
• Two wide neighborhood interior-point methods for symmetric cone optimization (Q2401022) (← links)