An interior-point algorithm for nonlinear minimax problems (Q963659): 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: George Tzallas-Regas / rank
Normal rank
 
Property / author
 
Property / author: Berc Rustem / rank
Normal rank
 
Property / author
 
Property / author: George Tzallas-Regas / rank
 
Normal rank
Property / author
 
Property / author: Berc Rustem / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: AMPL / 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/s10957-009-9599-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2132447315 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / 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: Q3491304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-point methods for nonconvex nonlinear programming: jamming and numerical testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally convergent interior-point algorithm for nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constrained min-max algorithm for rival models of the same economic system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax solution of the multiple-target problem / 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: The watchdog technique for forcing convergence in algorithms for constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent stepsizes for constrained optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equality and inequality constrained optimization algorithms with convergent stepsizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Inequality-Constrained Discrete Min--Max Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A globally convergent primal-dual interior point method for constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Switching stepsize strategies for sequential quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Modeling Language for Mathematical Programming / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:04, 2 July 2024

scientific article
Language Label Description Also known as
English
An interior-point algorithm for nonlinear minimax problems
scientific article

    Statements

    An interior-point algorithm for nonlinear minimax problems (English)
    0 references
    0 references
    0 references
    0 references
    13 April 2010
    0 references
    The algorithm is based on the primal-dual interior-point method described in the paper of \textit{I. Akrotirianakis} and \textit{B. Rustem} [J. Optimization Theory Appl. 125, No. 3, 497--521 (2005; Zbl 1079.90154)] and based on the minimax approach of \textit{B. Rustem} [Math. Program., Ser. A 53, No. 3, 279--295 (1992; Zbl 0751.90057)] with the different choice of the merit function, stepsize rule and computation of search direction. For a constrained nonlinear, discrete minimax problem where the objective functions and constraints are not necessarily convex, the algorithm uses two merit functions to ensure progress toward the points satisfying the first-order optimality conditions of the original problem. Convergence properties are described and numerical results provided.
    0 references
    primal-dual interior-point method
    0 references
    discrete min-max
    0 references
    stepsize rule
    0 references
    constrained non-linear programming
    0 references

    Identifiers