Pages that link to "Item:Q2340336"

The following pages link to A homogeneous interior-point algorithm for nonsymmetric convex conic optimization (Q2340336):

Displaying 39 items.

• Conic optimization via operator splitting and homogeneous self-dual embedding (Q301735) (← links)
• A polynomial-time interior-point method for circular cone programming based on kernel functions (Q747043) (← links)
• A computational study of the homogeneous algorithm for large-scale convex optimization (Q1273428) (← links)
• A path following interior-point method for linear complementarity problems over circular cones (Q1630229) (← links)
• Semidefinite approximations of the matrix logarithm (Q1740571) (← links)
• A primal barrier function phase I algorithm for nonsymmetric conic optimization problems (Q1926650) (← links)
• On merit functions for \(p\)-order cone complementarity problem (Q2012235) (← links)
• Newton polytopes and relative entropy optimization (Q2067684) (← links)
• On self-concordant barriers for generalized power cones (Q2115322) (← links)
• A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization (Q2149553) (← links)
• Status determination by interior-point methods for convex optimization problems in domain-driven form (Q2149574) (← links)
• Extension of the LP-Newton method to conic programming problems via semi-infinite representation (Q2225528) (← links)
• The decompositions with respect to two core non-symmetric cones (Q2301185) (← links)
• Primal-dual interior-point algorithms for convex quadratic circular cone optimization (Q2353476) (← links)
• The \(p\)-cones in dimension \(n\geq 3\) are not homogeneous when \(p\neq 2\) (Q2404977) (← links)
• Relative entropy relaxations for signomial optimization (Q2805708) (← links)
• A nonmonotone smoothing Newton method for circular cone programming (Q2836100) (← links)
• Matrix-Free Convex Optimization Modeling (Q2957708) (← links)
• HOMOGENEOUS SELF-DUAL METHODS FOR SYMMETRIC CONES UNDER UNCERTAINTY (Q2964352) (← links)
• (Q3089863) (← links)
• (Q3632453) (← links)
• Sum-of-Squares Optimization without Semidefinite Programming (Q4629344) (← links)
• An algorithm for nonsymmetric conic optimization inspired by MOSEK (Q5043851) (← links)
• Solving Natural Conic Formulations with Hypatia.jl (Q5058009) (← links)
• Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization (Q5076724) (← links)
• Alfonso: Matlab Package for Nonsymmetric Conic Optimization (Q5084625) (← links)
• Primal-Dual Interior-Point Methods for Domain-Driven Formulations (Q5119848) (← links)
• Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets (Q5129197) (← links)
• Towards non-symmetric conic optimization (Q5200566) (← links)
• Characterizations of Boundary Conditions on Some Non-Symmetric Cones (Q5861984) (← links)
• Convergence of Anisotropic Mesh Adaptation via Metric Optimization (Q5864680) (← links)
• Sum of squares generalizations for conic sets (Q6038674) (← links)
• Error bounds, facial residual functions and applications to the exponential cone (Q6044980) (← links)
• Linear optimization over homogeneous matrix cones (Q6047504) (← links)
• A new perspective on low-rank optimization (Q6052053) (← links)
• Performance enhancements for a generic conic interior point algorithm (Q6102857) (← links)
• (Q6149328) (← links)
• Computing conjugate barrier information for nonsymmetric cones (Q6596336) (← links)
• Solving clustered low-rank semidefinite programs arising from polynomial optimization (Q6645951) (← links)