scientific article
From MaRDI portal
Publication:3415802
zbMath1136.90509MaRDI QIDQ3415802
Publication date: 19 January 2007
Full work available at URL: http://www.ici.ro/camo/journal/v5n1.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (70)
Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier ⋮ Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function ⋮ Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation ⋮ A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function ⋮ A path following interior-point method for linear complementarity problems over circular cones ⋮ Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems ⋮ Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function ⋮ An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function ⋮ Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions ⋮ A polynomial interior-point algorithm for monotone linear complementarity problems ⋮ A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization ⋮ Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem ⋮ A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming ⋮ Complexity analysis of a full-{N}ewton step interior-point method for linear optimization ⋮ A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems ⋮ A new corrector-predictor interior-point method for symmetric cone optimization ⋮ An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization ⋮ A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization ⋮ New complexity analysis of a full Nesterov–Todd step interior-point method for semidefinite optimization ⋮ Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step ⋮ Interior-point algorithm for linear programming based on a new descent direction ⋮ Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations ⋮ A wide neighbourhood primal-dual second-order corrector interior point algorithm for semidefinite optimization ⋮ Corrector-predictor interior-point method with new search direction for semidefinite optimization ⋮ A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation ⋮ A full-Newton step interior-point method for monotone weighted linear complementarity problems ⋮ A class of new search directions for full-NT step feasible interior point method in semidefinite optimization ⋮ A new search direction for full-Newton step infeasible interior-point method in linear optimization ⋮ A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization ⋮ A corrector-predictor interior-point method with new search direction for linear optimization ⋮ The new full-Newton step interior-point algorithm for the Fisher market equilibrium problems based on a kernel function ⋮ A full-Newton step interior-point algorithm for linear optimization based on a finite barrier ⋮ A New Search Direction for Full-Newton Step Interior-Point Method in P*(κ)-HLCP ⋮ Unnamed Item ⋮ New Interior-Point Algorithm for Symmetric Optimization Based on a Positive-Asymptotic Barrier Function ⋮ A new infeasible interior-point method based on Darvay's technique for symmetric optimization ⋮ A weighted-path-following method for symmetric cone linear complementarity problems ⋮ A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization ⋮ A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function ⋮ A generalized direction in interior point method for monotone linear complementarity problems ⋮ A new full-NT step interior-point method for circular cone optimization ⋮ Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization ⋮ New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP ⋮ A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem ⋮ A corrector-predictor path-following method for convex quadratic symmetric cone optimization ⋮ A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions ⋮ A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization ⋮ A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization ⋮ An infeasible interior point method for the monotone SDLCP based on a transformation of the central path ⋮ New method for determining search directions for interior-point algorithms in linear optimization ⋮ Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood ⋮ A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step ⋮ Unnamed Item ⋮ Simplified infeasible interior-point algorithm for linear optimization based on a simple function ⋮ An extension for identifying search directions for interior-point methods in linear optimization ⋮ A full-Newton step infeasible interior-point method for the special weighted linear complementarity problem ⋮ A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization ⋮ A new primal-dual path-following interior-point algorithm for semidefinite optimization ⋮ Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO ⋮ A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function ⋮ Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction ⋮ An improved and modified infeasible interior-point method for symmetric optimization ⋮ A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization ⋮ Unnamed Item ⋮ Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function ⋮ New complexity analysis of full Nesterov-Todd step infeasible interior point method for second-order cone optimization ⋮ Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique ⋮ Unnamed Item ⋮ Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization ⋮ Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term
This page was built for publication:
