Primal-Dual Interior-Point Methods for Self-Scaled Cones
From MaRDI portal
Recommendations
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Generalization of primal-dual interior-point methods to convex optimization problems in conic form
- Interior-point methods for optimization
- scientific article; zbMATH DE number 1047680
- Interior-point methods for convex programming
Cited in
(only showing first 100 items - show all)- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP
- Numerical experiments with universal barrier functions for cones of Chebyshev systems
- Risk optimization with p-order conic constraints: a linear programming approach
- On the long-step path-following method for semidefinite programming
- Superlinear convergence of interior-point algorithms for semidefinite programming
- Characterization of the barrier parameter of homogeneous convex cones
- Affine scaling algorithm fails for semidefinite programming
- Polynomial primal-dual cone affine scaling for semidefinite programming
- Symmetric primal-dual path-following algorithms for semidefinite programming
- A long-step primal-dual path-following method for semidefinite programming
- Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
- Interior-point methods: An old and new approach to nonlinear programming
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- An interior-point method for a class of saddle-point problems
- On implementing a primal-dual interior-point method for conic quadratic optimization
- Similarity and other spectral relations for symmetric cones
- Interior-point methods
- Nonnegative minimum biased quadratic estimation in mixed linear models
- On a commutative class of search directions for linear programming over symmetric cones
- Semidefinite programming
- Self-scaled barrier functions on symmetric cones and their classification
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
- Efficient solutions of interval programming problems with inexact parameters and second order cone constraints
- Primal Newton method for the linear cone programming problem
- Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions
- A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization
- A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization
- A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy
- Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions
- A relaxed-certificate facial reduction algorithm based on subspace intersection
- On the extension of an arc-search interior-point algorithm for semidefinite optimization
- Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones
- An arc search infeasible interior-point algorithm for symmetric optimization using a new wide neighborhood
- Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function
- On self-regular IPMs (with comments and rejoinder)
- ``Cone-free primal-dual path-following and potential-reduction polynomial time interior-point methods
- Product-form Cholesky factorization in interior point methods for second-order cone programming
- Efficient semidefinite branch-and-cut for MAP-MRF inference
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
- Linear programming, complexity theory and elementary functional analysis
- A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
- A new second-order corrector interior-point algorithm for semidefinite programming
- Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems
- Numerical algebraic geometry and semidefinite programming
- An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming
- Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence
- A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization
- A survey on conic relaxations of optimal power flow problem
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
- An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood
- Nonhomogeneous Karcher equations with vector fields on positive definite matrices
- \texttt{Tenscalc}: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria
- A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization
- An interior-point algorithm for semidefinite least-squares problems.
- A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization
- An arc-search predictor-corrector infeasible-interior-point algorithm for \(P_\ast(\kappa)\)-SCLCPs
- A wide neighborhood interior-point algorithm for convex quadratic semidefinite optimization
- A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood
- The Karcher mean of linearly independent triples
- \(\mathcal{UV}\)-theory of a class of semidefinite programming and its applications
- A pseudo-equilibrium finite element for limit analysis of Reissner-Mindlin plates
- A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function
- A corrector-predictor path-following method for convex quadratic symmetric cone optimization
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra
- A primal-dual interior-point algorithm with arc-search for semidefinite programming
- Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function
- Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization
- A primal-dual interior point method for large-scale free material optimization
- Credible autocoding of convex optimization algorithms
- On the central paths in symmetric cone programming
- An infeasible full NT-step interior point method for circular optimization
- An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path
- The primal-dual second-order cone approximations algorithm for symmetric cone programming
- A new infeasible-interior-point algorithm for linear programming over symmetric cones
- Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone
- A primal-dual interior-point method based on various selections of displacement step for symmetric optimization
- An infeasible interior-point algorithm for stochastic second-order cone optimization
- A variant of the affine-scaling method for a second-order cone program
- Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming
- New complexity analysis of interior-point methods for the Cartesian \(P_\ast ({\kappa})\)-SCLCP
- A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem
- Dual versus primal-dual interior-point methods for linear and conic programming
- Solvability of semidefinite complementarity problems
- Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function
- Equivalence of two nondegeneracy conditions for semidefinite programs
- On the behavior of the homogeneous self-dual model for conic convex optimization
- Intrinsic volumes of symmetric cones and applications in convex programming
- Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
- A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming
- A conversion of an SDP having free variables into the standard form SDP
- A new corrector-predictor interior-point method for symmetric cone optimization
- The dual simplex-type method for linear second-order cone programming problem
- Primal-dual symmetry and scale invariance of interior-point algorithms for convex optimization
- Self-scaled barriers for irreducible symmetric cones
- A new infeasible interior-point method based on a non-coercive kernel function with improved centering steps for second-order cone optimization
- An introduction to formally real Jordan algebras and their applications in optimization
This page was built for publication: Primal-Dual Interior-Point Methods for Self-Scaled Cones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4389195)
