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.
- Randomized interior point methods for sampling and optimization (Q259600) (← links)
- A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP (Q279828) (← links)
- Rapid smooth entry trajectory planning for high lift/drag hypersonic glide vehicles (Q283938) (← links)
- Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank (Q304255) (← links)
- An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results (Q312194) (← links)
- A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization (Q378264) (← links)
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming (Q378283) (← links)
- A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function (Q384190) (← links)
- Carlson's iterative mean algorithm of positive definite matrices (Q389582) (← 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)
- A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones (Q415402) (← links)
- On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function (Q425872) (← links)
- Homogeneous self-dual algorithms for stochastic second-order cone programming (Q467475) (← 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)
- A polynomial time constraint-reduced algorithm for semidefinite optimization problems (Q493064) (← links)
- An infeasible full-NT step interior point algorithm for CQSCO (Q503355) (← links)
- The resolvent average on symmetric cones of JB-algebras (Q513235) (← links)
- A polynomial primal-dual affine scaling algorithm for symmetric conic optimization (Q523579) (← links)
- Two new predictor-corrector algorithms for second-order cone programming (Q536560) (← links)
- A new self-dual embedding method for convex programming (Q557368) (← links)
- A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem (Q607084) (← links)
- Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones (Q621748) (← links)
- Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming (Q627455) (← links)
- Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems (Q630020) (← 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)
- A smoothing Newton method with Fischer-Burmeister function for second-order cone complementarity problems (Q639203) (← links)
- Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones (Q650213) (← links)
- Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term (Q695048) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Reflection-projection method for convex feasibility problems with an obtuse cone (Q704736) (← links)
- Self-concordant barriers for convex approximations of structured convex sets (Q707744) (← links)
- A primal-dual interior point method for nonlinear semidefinite programming (Q715092) (← 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 full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization (Q743780) (← links)
- On verified numerical computations in convex programming (Q849186) (← links)
- On central-path proximity measures in interior-point methods (Q850820) (← links)
- Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling (Q868464) (← links)
- A primal-dual symmetric relaxation for homogeneous conic systems (Q883335) (← 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)
- Largest dual ellipsoids inscribed in dual cones (Q959981) (← links)
- An interior-point method for the single-facility location problem with mixed norms using a conic formulation (Q999133) (← links)
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions (Q1012072) (← links)
- A new primal-dual path-following interior-point algorithm for semidefinite optimization (Q1014697) (← links)
