An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- A primal-dual decomposition algorithm for multistage stochastic convex programming
- A step-truncated method in a wide neighborhood interior-point algorithm for linear programming
- A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs
- An inexact feasible interior point method for linear optimization with high adaptability to quantum computers
- New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
- Global convergence in infeasible-interior-point algorithms
- An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems
- Interior-point methods for linear programming: a review
- Conic convex programming and self-dual embedding
- Interior-point methods
- A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation
- An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
- A framework for solving mixed-integer semidefinite programs
- Chordal decomposition in operator-splitting methods for sparse semidefinite programs
- Active-set prediction for interior point methods using controlled perturbations
- Globally Convergent Type-I Anderson Acceleration for Nonsmooth Fixed-Point Iterations
- Identification of optimal feedback control rules from micro-quadrotor and insect flight trajectories
- Corrector-predictor methods for sufficient linear complementarity problems
- Method of approximate centers for semi-definite programming
- Smoothing-type algorithm for solving linear programs by using an augmented complementarity problem
- On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods
- A homogeneous model for monotone mixed horizontal linear complementarity problems
- Maximum-stopping-value policies in finite Markov population decision chains
- Conic programming: infeasibility certificates and projective geometry
- A new predictor-corrector infeasible interior-point algorithm for linear optimization in a wide neighborhood
- \(\mathcal{N}\)IPM-HLSP: an efficient interior-point method for hierarchical least-squares programs
- A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization
- A Barzilai and Borwein regularization feasible direction algorithm for convex nonlinear SOC programming with linear constraints
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding
- Primal-dual target-following algorithms for linear programming
- Numerical algebraic geometry and semidefinite programming
- On two measures of problem instance complexity and their correlation with the performance of SeDuMi on second-order cone problems
- A fixed point iterative approach to integer programming and its distributed computation
- Improved complexity using higher-order correctors for primal-dual Dikin affine scaling
- An O( nL) iteration primal-dual second-order corrector algorithm for linear programming
- A full-Newton step infeasible interior-point method for linear optimization based on an exponential kernel function
- New method for determining search directions for interior-point algorithms in linear optimization
- A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function
- A survey on conic relaxations of optimal power flow problem
- Efficient use of quantum linear system algorithms in inexact infeasible IPMs for linear optimization
- The practical behavior of the homogeneous self-dual formulations in interior point methods
- A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones
- A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
- Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions
- An infeasible-interior-point algorithm using projections onto a convex set
- First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games
- A faster interior-point method for sum-of-squares optimization
- A predictor-corrector algorithm with multiple corrections for convex quadratic programming
- On the implementation and usage of SDPT3 -- a Matlab software package for semidefinite-quadratic-linear programming, version 4.0
- Primal-dual interior-point methods for domain-driven formulations
- A quantum interior-point predictor–corrector algorithm for linear programming
- A simplified homogeneous and self-dual linear programming algorithm and its implementation
- An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
- Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
- Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function
- On homogeneous interrior-point algorithms for semidefinite programming
- Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems
- An efficient implementation of interior-point methods for a class of nonsymmetric cones
- A primal-dual symmetric relaxation for homogeneous conic systems
- Finite convergence into a convex polytope via facet reflections.
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- On homogeneous and self-dual algorithms for LCP
- Primal-dual path-following methods and the trust-region updating strategy for linear programming with noisy data
- The complexity of self-regular proximity based infeasible IPMs
- Status determination by interior-point methods for convex optimization problems in domain-driven form
- A modified full-Newton step infeasible interior-point algorithm for linear optimization
- An adaptive updating full-Newton step interior-point algorithm with modified Newton direction
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
- Crash start of interior point methods
- The analyticity of interior-point-paths at strictly complementary solutions of linear programs
- Embedding methods for semidefinite programming
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
- An easy way to teach interior-point methods.
- Interior Point Methods for Nonlinear Optimization
- Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization
- A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem
- An alternating direction method for second-order conic programming
- A corrector-predictor interior-point method with new search direction for linear optimization
- Computational experience with a modified potential reduction algorithm for linear programming
- Solution refinement at regular points of conic problems
- A homogeneous smoothing-type algorithm for symmetric cone linear programs
- Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
- A new feasible interior-point algorithm with full step for linear optimization based on a simple function
- scientific article; zbMATH DE number 851571 (Why is no real title available?)
- An ADMM-based interior-point method for large-scale linear programming
- Grasping force optimization for multi-fingered robotic hands using projection and contraction methods
- On the behavior of the homogeneous self-dual model for conic convex optimization
- On implementation of a self-dual embedding method for convex programming
- An algorithm for nonsymmetric conic optimization inspired by MOSEK
- Efficient semidefinite branch-and-cut for MAP-MRF inference
- Solving conic optimization problems via self-dual embedding and facial reduction: A unified approach
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Operator splitting for a homogeneous embedding of the linear complementarity problem
- A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy
- Strict complementarity in semidefinite optimization with elliptopes including the maxcut SDP
This page was built for publication: An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4294729)
