On a General Class of Interior-Point Algorithms for Semidefinite Programming With Polynomial Complexity and Superlinear Convergence

Methods and Applications of Analysis
doi 10.4310/maa.1999.v6.n4.a8
Full Text
Abstract

Available in full text

Date
Authors
Publisher

International Press of Boston

Related search

A Class of Polynomial Volumetric Barrier Decomposition Algorithms for Stochastic Semidefinite Programming

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
2010English

Low-Complexity Interior Point Algorithms for Stochastic Programming: Derivation Analysis and Performance Evaluation

2000English

Superlinear Convergence of an Infeasible Predictor-Corrector Path-Following Interior Point Algorithm for a Semidefinite Linear Complementarity Problem Using the Helmberg–Kojima–Monteiro Direction

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
2011English

A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programming

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
1993English

A Primal-Dual Interior-Point Method for the Semidefinite Programming Problem Based on a New Kernel Function

Journal of Nonlinear Functional Analysis
ControlNumerical AnalysisAlgebraGeometryFluid FlowAnalysisNumber TheoryOptimizationTransfer ProcessesTopology
2019English

On the Convergence and O(1/N) Complexity of a Class of Nonlinear Proximal Point Algorithms for Monotonic Variational Inequalities

Statistics, Optimization and Information Computing
ControlInformation SystemsPattern RecognitionProbabilityUncertaintyComputer VisionOptimizationStatisticsSignal ProcessingArtificial Intelligence
2014English

Superlinear Convergence of Affine-Scaling Interior-Point Newton Methods for Infinite-Dimensional Nonlinear Problems With Pointwise Bounds

SIAM Journal on Control and Optimization
ControlApplied MathematicsOptimization
2000English

Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
1996English

An Interior Point Method for Linear Programming Based on a Class of Kernel Functions

Bulletin of the Australian Mathematical Society
Mathematics
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy