An infeasible interior-point algorithm for solving primal and dual geometric programs (Q1361109): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted multinomial maximum likelihood estimation based upon Fenchel duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4113605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum likelihood estimates with order restrictions on probabilities and odds ratios: A geometric programming approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal design modifications by geometric programming and constrained stochastic network models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-infinite programming, differentiability and geometric programming: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A set of geometric programming test problems and their solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual to primal conversion in geometric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5557595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the formulation and theory of the Newton interior-point method for nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Controlled dual perturbations for posynomial programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Objective function and logarithmic barrier function properties in convex programming: level sets, solution attainment and strict convexity<sup>*</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a classification scheme for geometric programming and complementarity theorems†<sup>†</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: On meromorphic solutions of a functional equation of Ganapathy Iyer / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logarithmic barrier cutting plane method for convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stochastic geometric programming problem with multiplicative recourse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence in infeasible-interior-point algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying convex extremum problems over linear topologies having separation properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some efficient interior point methods for nonlinear convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On controlling the parameter in the logarithmic barrier term for convex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Newton-Cauchy framework. A unified approach to unconstrained nonlinear minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bibliographical note on geometric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of generalized geometric programming algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039968 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Allocation of resources in project management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric Quasidefinite Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Controlled dual perturbations for central path trajectories in geometric programming / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02614382 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2032834460 / rank
 
Normal rank

Latest revision as of 08:59, 30 July 2024

scientific article
Language Label Description Also known as
English
An infeasible interior-point algorithm for solving primal and dual geometric programs
scientific article

    Statements

    An infeasible interior-point algorithm for solving primal and dual geometric programs (English)
    0 references
    0 references
    23 July 1997
    0 references
    convex analysis
    0 references
    infeasible primal-dual algorithm
    0 references
    duality
    0 references
    numerical implementation
    0 references
    subfeasible solutions
    0 references
    posynomial geometric programming
    0 references
    sparse matrix factorizations
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers