Self-Scaled Barriers and Interior-Point Methods for Convex Programming
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- A Geodesic Interior-Point Method for Linear Optimization over Symmetric Cones
- A long-step interior-point algorithm for symmetric cone Cartesian P_ ()-HLCP
- Infeasible Mehrotra-type predictor-corrector interior-point algorithm for the Cartesian P_()-LCP over symmetric cones
- A new \(O(\sqrt nL)\) iteration large-update primal-dual interior-point method for second-order cone programming
- A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization
- A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
- Self-scaled barriers for irreducible symmetric cones
- Interior-point methods
- On the nonlinear matrix equation \(X^p = A + M^T (X \# B) M\)
- Return-mapping algorithms for associative isotropic hardening plasticity using conic optimization
- Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
- scientific article; zbMATH DE number 6285133 (Why is no real title available?)
- A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- Interior-point methods based on kernel functions for symmetric optimization
- A convex analysis view of the barrier problem
- Implementation of primal-dual methods for semidefinite programming based on Monteiro and Tsuchiya Newton directions and their variants
- Approximate minimum enclosing balls in high dimensions using core-sets
- A robust algorithm for semidefinite programming
- Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step
- Randomized interior point methods for sampling and optimization
- A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
- The resolvent average on symmetric cones
- Two new predictor-corrector algorithms for second-order cone programming
- Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
- A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
- Characterization of the barrier parameter of homogeneous convex cones
- Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers
- On extending primal-dual interior-point method for linear optimization to convex quadratic symmetric cone optimization
- An \(\operatorname{O}(\sqrt{r}(\operatorname{cond}(G))^{1 / 4}\log \varepsilon^{- 1})\) iteration predictor-corrector interior-point method with a new one-norm neighbourhood for symmetric cone optimization
- Semi-definite programming and quantum information
- Jordan automorphisms and derivatives of symmetric cones
- Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones
- Affine scaling algorithm fails for semidefinite programming
- Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms
- Proximal-stabilized semidefinite programming
- Superlinear convergence of an interior point algorithm on linear semi-definite feasibility problems
- A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms
- On the \(P_*(\kappa)\) horizontal linear complementarity problems over Cartesian product of symmetric cones
- Semidefinite programming
- An infeasible full-NT step IPM for P_() horizontal linear complementarity problem over Cartesian product of symmetric cones
- A corrector-predictor interior-point algorithm for P_()-HLCPs over Cartesian product of symmetric cones
- Simplified analysis for full-Newton step infeasible interior-point algorithm for semidefinite programming
- A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization
- Mesh adaptive computation of upper and lower bounds in limit analysis
- An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming
- A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization
- A new infeasible interior-point method based on a non-coercive kernel function with improved centering steps for second-order cone optimization
- Interior-point methods: An old and new approach to nonlinear programming
- On verified numerical computations in convex programming
- Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization
- An interior-point algorithm for semidefinite least-squares problems.
- Self-concordant barriers for convex approximations of structured convex sets
- A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP
- Rapid smooth entry trajectory planning for high lift/drag hypersonic glide vehicles
- Linear optimization over homogeneous matrix cones
- A new self-dual embedding method for convex programming
- Complexity analysis and numerical implementation of a new interior-point algorithm for semidefinite optimization
- A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
- Primal-dual symmetry and scale invariance of interior-point algorithms for convex optimization
- Semidefinite programming and matrix scaling over the semidefinite cone.
- A full Nesterov-Todd step primal-dual path-following interior point algorithm for semidefinite linear complementarity problems
- An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization
- New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd direction
- Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence
- A new polynomial interior-point algorithm for the monotone linear complementarity problem over symmetric cones with full NT-steps
- An O( n L) iteration primal-dual path-following method, based on wide neighbourhood and large update, for second-order cone programming
- Semidefinite programming for discrete optimization and matrix completion problems
- A new second-order corrector interior-point algorithm for semidefinite programming
- An efficient primal-dual interior point algorithm for convex quadratic semidefinite optimization
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming
- A corrector-predictor path-following algorithm for semidefinite optimization
- Second-order cone programming approaches to static shakedown analysis in steel plasticity
- Applications of second-order cone programming
- A new infeasible interior-point method based on Darvay's technique for symmetric optimization
- Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm
- Projectively Self-Concordant Barriers
- Towards non-symmetric conic optimization
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- A smoothing Newton method with Fischer-Burmeister function for second-order cone complementarity problems
- A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
- A self-concordant exponential kernel function for primal-dual interior-point algorithm
- An infeasible interior point method for the monotone SDLCP based on a transformation of the central path
- A study of search directions in primal-dual interior-point methods for semidefinite programming
- Computing conjugate barrier information for nonsymmetric cones
- Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems
- A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function
- Efficient solutions of interval programming problems with inexact parameters and second order cone constraints
- Optimal risk transfer: a numerical optimization approach
- The inverse mean problem of geometric mean and contraharmonic means
- Gaddum's test for symmetric cones
- A survey on conic relaxations of optimal power flow problem
- New predictor-corrector algorithm for symmetric cone horizontal linear complementarity problems
- A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
This page was built for publication: Self-Scaled Barriers and Interior-Point Methods for Convex Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4339371)
