A primal-dual infeasible-interior-point algorithm for linear semi-infinite programming

Ruey-Lin Sheu; Shih-Ying Wu; Shu‐Cherng Fang

doi:10.1016/0898-1221(95)00025-t

ScienceGate Book Chapters

JOURNAL ARTICLE

A primal-dual infeasible-interior-point algorithm for linear semi-infinite programming

Ruey-Lin Sheu Shih-Ying Wu Shu‐Cherng Fang

Year: 1995 Journal: Computers & Mathematics with Applications Vol: 29 (8)Pages: 7-18 Publisher: Elsevier BV

DOI: 10.1016/0898-1221(95)00025-t

Get Full-Text PDF Get Analytical Report

Keywords:

Interior point method Linear programming Mathematics Criss-cross algorithm Semi-infinite programming Convergence (economics) Linear-fractional programming Dual (grammatical number) Mathematical optimization Algorithm Point (geometry)

Metrics

Cited By

0.52

FWCI (Field Weighted Citation Impact)

Refs

0.61

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Optimization Algorithms Research

Physical Sciences → Mathematics → Numerical Analysis

Optimization and Variational Analysis

Physical Sciences → Computer Science → Computational Theory and Mathematics

Advanced Control Systems Optimization

Physical Sciences → Engineering → Control and Systems Engineering

A primal-dual infeasible-interior-point algorithm for linear semi-infinite programming

Metrics

Citation History

Topics

Related Documents

A primal—dual infeasible-interior-point algorithm for linear programming

A primal-dual infeasible-interior-point algorithm for multiple objective linear programming problems

Infeasible primal-dual interior-point algorithm for linear-programming decoding of LDPC codes

Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming

A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming