Pages that link to "Item:Q4339371"
From MaRDI portal
The following pages link to Self-Scaled Barriers and Interior-Point Methods for Convex Programming (Q4339371):
Displaying 50 items.
- Risk optimization with \(p\)-order conic constraints: a linear programming approach (Q1038319) (← links)
- Applications of second-order cone programming (Q1124764) (← links)
- On the long-step path-following method for semidefinite programming (Q1273093) (← links)
- Characterization of the barrier parameter of homogeneous convex cones (Q1290599) (← links)
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming (Q1290605) (← links)
- Affine scaling algorithm fails for semidefinite programming (Q1290670) (← links)
- Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions (Q1294553) (← links)
- Polynomial primal-dual cone affine scaling for semidefinite programming (Q1294555) (← links)
- Symmetric primal-dual path-following algorithms for semidefinite programming (Q1294556) (← links)
- Interior-point methods: An old and new approach to nonlinear programming (Q1365059) (← links)
- Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems (Q1366422) (← links)
- An interior-point method for a class of saddle-point problems (Q1411479) (← links)
- Semidefinite programming and matrix scaling over the semidefinite cone. (Q1414710) (← links)
- Similarity and other spectral relations for symmetric cones (Q1573667) (← links)
- Interior-point methods (Q1593831) (← links)
- Nonnegative minimum biased quadratic estimation in mixed linear models (Q1599237) (← links)
- Semidefinite programming (Q1600854) (← 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)
- Efficient solutions of interval programming problems with inexact parameters and second order cone constraints (Q1634750) (← links)
- Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions (Q1644105) (← links)
- A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization (Q1660297) (← links)
- An inexact interior point method for the large-scale simulation of granular material (Q1667344) (← 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)
- On the extension of an arc-search interior-point algorithm for semidefinite optimization (Q1713225) (← links)
- Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones (Q1730771) (← links)
- On self-regular IPMs (with comments and rejoinder) (Q1769946) (← links)
- ``Cone-free'' primal-dual path-following and potential-reduction polynomial time interior-point methods (Q1771312) (← links)
- Efficient algorithms for the smallest enclosing ball problem (Q1774576) (← links)
- Product-form Cholesky factorization in interior point methods for second-order cone programming (Q1777219) (← links)
- Strengthened existence and uniqueness conditions for search directions in semidefinite program\-ming (Q1779251) (← links)
- On self-concordant barrier functions for conic hulls and fractional programming (Q1814792) (← links)
- A new class of polynomial primal-dual methods for linear and semidefinite optimization (Q1848379) (← links)
- Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers (Q1881562) (← links)
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (Q1887719) (← links)
- Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm (Q1919098) (← links)
- A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function (Q1928163) (← links)
- The resolvent average on symmetric cones (Q1931727) (← links)
- A new second-order corrector interior-point algorithm for semidefinite programming (Q1935927) (← 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)
- A geometric mean of parameterized arithmetic and harmonic means of convex functions (Q1938303) (← links)
- Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems (Q1947198) (← links)
- Return-mapping algorithms for associative isotropic hardening plasticity using conic optimization (Q1988893) (← links)
- On the nonlinear matrix equation \(X^p = A + M^T (X \# B) M\) (Q1989192) (← links)
- An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming (Q1999885) (← links)
- Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence (Q2007836) (← links)
- Gaddum's test for symmetric cones (Q2022297) (← links)
- A survey on conic relaxations of optimal power flow problem (Q2023908) (← links)
- Solvability for two forms of nonlinear matrix equations (Q2043574) (← links)
