A new smoothing Newton-type algorithm for semi-infinite programming (Q969747): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: GQTPAR / 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/s10898-009-9462-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2009717218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and nonsmooth analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A projected lagrangian algorithm for semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inexact approach to solving linear semi-infinite programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal value function in semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-infinite programming. Recent advances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4192595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-Infinite Programming: Theory, Methods, and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3939127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual parametrization method for convex semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A QP-free constrained Newton-type method for variational inequality problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Linear Semi-Infinite Programming Problems: An Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A smoothing Newton method for semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semismooth and Semiconvex Functions in Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a Trust Region Step / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Truncated Projected Newton-Type Algorithm for Large-Scale Semi-infinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonsmooth Equations: Motivation and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recursive quadratic programming algorithm for semi-infinite optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A smoothing projected Newton-type algorithm for semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differentiability and semismoothness properties of integral functions and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonsmooth version of Newton's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semismooth Newton methods for solving semi-infinite programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3873909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second-order optimality conditions in generalized semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The semismooth approach for semi-infinite programming under the reduction ansatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discretization in semi-infinite programming: the rate of convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A globally convergent SQP method for semi-infinite nonlinear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new computational algorithm for functional inequality constrained optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational discretization algorithms for functional inequality constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-point algorithms for semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multiple Exchange Algorithm for Multivariate Chebyshev Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative method for solving KKT system of the semi-infinite programming / rank
 
Normal rank

Latest revision as of 19:04, 2 July 2024

scientific article
Language Label Description Also known as
English
A new smoothing Newton-type algorithm for semi-infinite programming
scientific article

    Statements

    A new smoothing Newton-type algorithm for semi-infinite programming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 May 2010
    0 references
    semi-infinite programming (SIP) problem
    0 references
    KKT system
    0 references
    nonsmooth equations
    0 references
    smoothing method
    0 references
    convergence
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers