Pages that link to "Item:Q3544266"
From MaRDI portal
The following pages link to On Mehrotra-Type Predictor-Corrector Algorithms (Q3544266):
Displaying 43 items.
- An \(O(\sqrt{n}L)\) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem (Q279835) (← links)
- A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood (Q306400) (← links)
- A polynomial arc-search interior-point algorithm for linear programming (Q378268) (← links)
- A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization (Q394386) (← links)
- A constraint-reduced variant of Mehrotra's predictor-corrector algorithm (Q429507) (← links)
- Robust continuation methods for tracing solution curves of parameterized systems (Q457042) (← links)
- New barrier parameter updating technique in Mehrotra-type algorithm (Q553428) (← links)
- An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming (Q644523) (← links)
- Polynomial time second order mehrotra-type predictor--corrector algorithms (Q864824) (← links)
- Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms (Q881509) (← links)
- Further development of multiple centrality correctors for interior point methods (Q1029632) (← links)
- An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming (Q1653277) (← links)
- A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones (Q1743538) (← links)
- Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem (Q1760104) (← links)
- A new second-order corrector interior-point algorithm for semidefinite programming (Q1935927) (← links)
- Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones (Q1937004) (← links)
- An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming (Q1999885) (← links)
- An interior-point algorithm for linear programming with optimal selection of centering parameter and step size (Q2059175) (← links)
- On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems (Q2067705) (← links)
- A Mehrotra type predictor-corrector interior-point algorithm for linear programming (Q2273110) (← links)
- On the convergence of a predictor-corrector variant algorithm (Q2355008) (← links)
- A finite termination Mehrotra-type predictor-corrector algorithm (Q2383922) (← links)
- A predictor-corrector algorithm for linear optimization based on a modified Newton direction (Q2511088) (← links)
- A new second-order Mehrotra-type predictor-corrector algorithm for SDO (Q2825271) (← links)
- New complexity analysis of a Mehrotra-type predictor–corrector algorithm for semidefinite programming (Q2867429) (← links)
- On Mehrotra-type predictor-corrector algorithms for convex quadratic programming (Q2887168) (← links)
- Object Library of Algorithms for Dynamic Optimization Problems: Benchmarking SQP and Nonlinear Interior Point Methods (Q3089761) (← links)
- Predictor-corrector interior point method for contact analysis models with multi-point constraints (Q3121394) (← links)
- A primal–dual predictor–corrector interior-point method for symmetric cone programming with O(√r log <i>ϵ</i><sup>−1</sup>) iteration complexity (Q3174878) (← links)
- Mehrotra-type predictor-corrector algorithm revisited (Q3539794) (← links)
- Improvements on a predictor–corrector strategy for parameter estimation with several data types (Q3643529) (← links)
- Perturbed path following predictor-corrector interior point algorithms (Q4504781) (← links)
- A Mehrotra predictor-corrector interior-point algorithm for semidefinite optimization (Q4633251) (← links)
- Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the Cartesian<b><i>P</i></b><sub>*</sub>(κ)-LCP Over Symmetric Cones (Q4979787) (← links)
- Deepest point of a polyhedron and linear programming (Q4981863) (← links)
- An predictor–corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood (Q5031228) (← links)
- A Mehrotra Type Predictor-Corrector Interior-Point Method for P∗(κ)-HLCP (Q5039376) (← links)
- An O(r(cond(G))1/4log¼ϵ−1) iteration predictor–corrector interior-point method with a new one-norm neighbourhood for symmetric cone optimization (Q5045166) (← links)
- Median bilinear models in presence of extreme values (Q5063393) (← links)
- Polynomial convergence of Mehrotra-type predictor–corrector algorithm for the Cartesian<i>P</i><sub>∗</sub>(κ)-LCP over symmetric cones (Q5248204) (← links)
- A survey on compressive sensing: classical results and recent advancements (Q5855706) (← links)
- A step-truncated method in a wide neighborhood interior-point algorithm for linear programming (Q6110633) (← links)
- Extending interior-point methods to nonlinear second-order cone programming: application to finite-strain elastoplasticity (Q6553250) (← links)
