Pages that link to "Item:Q4294729"

The following pages link to An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm (Q4294729):

Displaying 50 items.

• A Barzilai and Borwein regularization feasible direction algorithm for convex nonlinear SOC programming with linear constraints (Q2231300) (← links)
• An adaptive updating full-Newton step interior-point algorithm with modified Newton direction (Q2261941) (← links)
• Grasping force optimization for multi-fingered robotic hands using projection and contraction methods (Q2275328) (← links)
• Solution refinement at regular points of conic problems (Q2282811) (← links)
• Simplified infeasible interior-point algorithm for linear optimization based on a simple function (Q2294231) (← links)
• Chordal decomposition in operator-splitting methods for sparse semidefinite programs (Q2297655) (← links)
• A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs (Q2316619) (← links)
• Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization (Q2346399) (← links)
• A complementarity partition theorem for multifold conic systems (Q2434990) (← links)
• New complexity analysis of IIPMs for linear optimization based on a specific self-regular function (Q2462141) (← links)
• On the behavior of the homogeneous self-dual model for conic convex optimization (Q2492677) (← links)
• Smoothing-type algorithm for solving linear programs by using an augmented complementarity problem (Q2496370) (← links)
• The complexity of self-regular proximity based infeasible IPMs (Q2506182) (← links)
• A primal-dual decomposition algorithm for multistage stochastic convex programming (Q2571003) (← links)
• A new corrector-predictor interior-point method for symmetric cone optimization (Q2678433) (← links)
• The State-of-the-Art in Conic Optimization Software (Q2802542) (← links)
• On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0 (Q2802544) (← links)
• A MODIFIED FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR LINEAR OPTIMIZATION (Q2873836) (← links)
• Embedding methods for semidefinite programming (Q2885491) (← links)
• A new infeasible interior-point algorithm with full step for linear optimization based on a simple function (Q2885543) (← links)
• Interior-point methods for linear programming: a review (Q3150491) (← links)
• On implementation of a self-dual embedding method for convex programming (Q3377974) (← links)
• Interior Point Methods for Nonlinear Optimization (Q3569506) (← links)
• Method of approximate centers for semi-definite programming (Q4345241) (← links)
• On homogeneous interrior-point algorithms for semidefinite programming (Q4391293) (← links)
• The analyticity of interior-point-paths at strictly complementary solutions of linear programs (Q4391295) (← links)
• Implementation of interior point methods for mixed semidefinite and second order cone optimization problems (Q4405940) (← links)
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3 (Q4504792) (← links)
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones (Q4504796) (← links)
• Conic convex programming and self-dual embedding (Q4525130) (← links)
• A framework for solving mixed-integer semidefinite programs (Q4637832) (← links)
• An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization (Q4916322) (← links)
• A New Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood (Q4988920) (← links)
• An ADMM-based interior-point method for large-scale linear programming (Q4999335) (← links)
• Operator Splitting for a Homogeneous Embedding of the Linear Complementarity Problem (Q5010047) (← links)
• Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function (Q5038177) (← links)
• An algorithm for nonsymmetric conic optimization inspired by MOSEK (Q5043851) (← links)
• Primal-Dual Path-Following Methods and the Trust-Region Updating Strategy for Linear Programming with Noisy Data (Q5090518) (← links)
• Primal-Dual Interior-Point Methods for Domain-Driven Formulations (Q5119848) (← links)
• Globally Convergent Type-I Anderson Acceleration for Nonsmooth Fixed-Point Iterations (Q5139834) (← links)
• Computational experience with a modified potential reduction algorithm for linear programming (Q5200565) (← links)
• Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP (Q5242927) (← links)
• Maximum-Stopping-Value Policies in Finite Markov Population Decision Chains (Q5244857) (← links)
• Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach (Q5275296) (← links)
• A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function (Q5299916) (← links)
• A FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT METHOD FOR LINEAR OPTIMIZATION BASED ON AN EXPONENTIAL KERNEL FUNCTION (Q5417513) (← links)
• A quantum interior-point predictor–corrector algorithm for linear programming (Q5871119) (← links)
• An easy way to teach interior-point methods. (Q5932020) (← links)
• A faster interior-point method for sum-of-squares optimization (Q6053475) (← links)
• CvxPnPL: a unified convex solution to the absolute pose estimation problem from point and line correspondences (Q6098357) (← links)