Keyword: interior point methods

Found 237 papers in total
A New Complexity Analysis for Full-Newton Step Infeasible Interior-Point Algorithm for Horizontal Linear Complementarity Problems
A New Complexity Analysis for Full-Newton Step Infeasible Interior-Point Algorithm for Horizontal Linear Complementarity Problems
2014,
In this paper, we first present a full‐Newton step feasible...
Complexity analysis and numerical implementation of primal‐dual interior‐point methods for convex quadratic optimization based on a finite barrier
Complexity analysis and numerical implementation of primal‐dual interior‐point methods for convex quadratic optimization based on a finite barrier
2013,
In this paper, we present primal‐dual interior‐point methods for convex...
Addressing Rank Degeneracy in Constraint‐Reduced Interior‐Point Methods for Linear Optimization
Addressing Rank Degeneracy in Constraint‐Reduced Interior‐Point Methods for Linear Optimization
2014,
In earlier works (Tits et al., 2006; Winternitz et al., 2012), the present authors and...
Simplified infeasible interior‐point algorithm for SDO using full Nesterov‐Todd step
Simplified infeasible interior‐point algorithm for SDO using full Nesterov‐Todd step
2012,
Interior‐point methods for semidefinite optimization problems have been studied...
A full‐Newton step infeasible interior‐point algorithm for monotone LCP based on a locally‐kernel function
A full‐Newton step infeasible interior‐point algorithm for monotone LCP based on a locally‐kernel function
2012,
We propose a new full‐Newton step infeasible interior‐point algorithm...
Primal‐dual interior‐point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
Primal‐dual interior‐point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
2012,
In this paper we propose primal‐dual interior‐point algorithms for...
A new infeasible interior‐point method based on Darvay’s technique for symmetric optimization
A new infeasible interior‐point method based on Darvay’s technique for symmetric optimization
2013,
We present a full Nesterov and Todd step primal‐dual infeasible...
Returns‐to‐scale properties in DEA models: the fundamental role of interior points
Returns‐to‐scale properties in DEA models: the fundamental role of interior points
2012,
Attempts can be found in the data envelopment analysis (DEA) literature to identify...
Strange behaviors of interior‐point methods for solving semidefinite programming problems in polynomial optimization
Strange behaviors of interior‐point methods for solving semidefinite programming problems in polynomial optimization
2012,
We observe that in a simple one‐dimensional polynomial optimization problem...
The Accuracy of Interior‐Point Methods Based on Kernel Functions
The Accuracy of Interior‐Point Methods Based on Kernel Functions
2012,
For the last decade, interior‐point methods that use barrier functions induced...
On the volumetric path
On the volumetric path
2012,
We consider the logarithmic and the volumetric barrier functions used in interior...
A new second‐order corrector interior‐point algorithm for semidefinite programming
A new second‐order corrector interior‐point algorithm for semidefinite programming
2012,
In this paper, we propose a second‐order corrector interior‐point...
Interior point methods for equilibrium problems
Interior point methods for equilibrium problems
2012,
In the present paper we discuss three methods for solving equilibrium‐type...
A unified kernel function approach to primal‐dual interior‐point algorithms for convex quadratic SDO (semidefinite optimization)
A unified kernel function approach to primal‐dual interior‐point algorithms for convex quadratic SDO (semidefinite optimization)
2011,
Kernel functions play an important role in the design and analysis of...
Looking for appropriate qualification conditions for subdifferential formulae and dual representations for convex risk measures
Looking for appropriate qualification conditions for subdifferential formulae and dual representations for convex risk measures
2011,
A fruitful idea, when providing subdifferential formulae and dual representations for...
An O(√nL) iteration primal‐dual second‐order corrector algorithm for linear programming
An O(√nL) iteration primal‐dual second‐order corrector algorithm for linear programming
2011,
In this paper, we propose a primal‐dual second‐order corrector interior...
A polynomial arc‐search interior‐point algorithm for convex quadratic programming
A polynomial arc‐search interior‐point algorithm for convex quadratic programming
2011,
Arc‐search is developed for linear programming in . The algorithms search for...
Full Nesterov–Todd step infeasible interior‐point method for symmetric optimization
Full Nesterov–Todd step infeasible interior‐point method for symmetric optimization
2011,
Euclidean Jordan algebras were proved more than a decade ago to be an indispensable...
A full‐Newton step interior‐point algorithm based on modified Newton direction
A full‐Newton step interior‐point algorithm based on modified Newton direction
2011,
The central path plays a very important role in interior‐point methods. By an...
Finding a strict feasible solution of a linear semidefinite program
Finding a strict feasible solution of a linear semidefinite program
2011,
This study deals with the performance of projective interior point methods for linear...
Primal‐dual interior‐point method for thermodynamic gas‐particle partitioning
Primal‐dual interior‐point method for thermodynamic gas‐particle partitioning
2011,
A mathematical model for the computation of the phase equilibrium and...
Discretization of interior point methods for state constrained elliptic optimal control problems: optimal error estimates and parameter adjustment
Discretization of interior point methods for state constrained elliptic optimal control problems: optimal error estimates and parameter adjustment
2011,
An adjustment scheme for the relaxation parameter of interior point approaches to the...
A full‐NT‐step infeasible interior‐point algorithm for SDP based on kernel functions
A full‐NT‐step infeasible interior‐point algorithm for SDP based on kernel functions
2011,
This paper proposes an infeasible interior‐point algorithm with full...
Using an iterative linear solver in an interior‐point method for generating support vector machines
Using an iterative linear solver in an interior‐point method for generating support vector machines
2010,
This paper concerns the generation of support vector machine classifiers for solving...
Papers per page: