Examples of ill-behaved central paths in convex optimization (Q1777216): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Gilbert, Jean Charles / rank
Normal rank
 
Property / author
 
Property / author: Clóvis C. Gonzaga / rank
Normal rank
 
Property / author
 
Property / author: Elizabeth W. Karas / rank
Normal rank
 
Property / author
 
Property / author: Gilbert, Jean Charles / rank
 
Normal rank
Property / author
 
Property / author: Clóvis C. Gonzaga / rank
 
Normal rank
Property / author
 
Property / author: Elizabeth W. Karas / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TRICE / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-003-0460-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2009666506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limiting behavior of the affine scaling continuous trajectories for linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories / rank
 
Normal rank
Property / cites work
 
Property / cites work: A trust region method based on interior point techniques for nonlinear programming. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing methods for convex inequalities and linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of smoothing functions for nonlinear and mixed complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945769 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5511041 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Interior Methods for Nonconvex Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path-Following Methods for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior point techniques in optimization. Complementarity, sensitivity and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to interior point algorithms for linear complementarity problems: A summary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limiting Behavior of the Derivatives of Certain Trajectories Associated with a Monotone Horizontal Linear Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence and convergence of the central path for convex programming and some duality results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior point methods of mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interior-point algorithm for nonconvex nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual interior point method whose running time depends only on the constraint matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5202840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691079 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:27, 10 June 2024

scientific article
Language Label Description Also known as
English
Examples of ill-behaved central paths in convex optimization
scientific article

    Statements

    Examples of ill-behaved central paths in convex optimization (English)
    0 references
    12 May 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    Central path
    0 references
    Convex optimization
    0 references
    Interior point algorithm
    0 references
    Nonlinear programming
    0 references
    Penalty function methods
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references