Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs (Q5501232): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964280104 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1403.1636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical bilevel optimization. Algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust sequential quadratic programming method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Epi-convergent Smoothing with Applications to Convex Composite Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient consistency for integral-convolution smoothing functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Global and Local Superlinear Continuation-Smoothing Method for<i>P</i><sub>0</sub>and<i>R</i><sub>0</sub>NCP or Monotone NCP / 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: Smoothing methods for nonsmooth, nonconvex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the Condition Number of a Gram Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and nonsmooth analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375488 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive gradient sampling algorithm for non-smooth optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5534710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of bilevel programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust recursive quadratic programming algorithm model with global and superlinear convergence properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Feasibility Issues in Mathematical Programs with Equilibrium Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential Quadratic Programming Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superlinearly convergent variable metric algorithms for general nonlinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A globally convergent method for nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projected Sequential Quadratic Programming Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refinements of necessary optimality conditions in nondifferentiable programming. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3813205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On solving simple bilevel programs with a nonconvex lower level program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence of a robust smoothing SQP method for semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Robust Algorithm for Optimization with General Equality and Inequality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory of Moral Hazard and Unobservable Behaviour: Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth minimization of non-smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updating Quasi-Newton Matrices with Limited Storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the numerical solution of a class of Stackelberg problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact penalty function algorithm with simple updating of the penalty parameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recursive quadratic programming algorithm that uses differentiable exact penalty functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variational Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4332850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new technique for inconsistent QP problems in the SQP method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisions of constraint approximations in the successive QP method for nonlinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A smoothing SQP method for nonlinear programs with stability constraints arising from power systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilevel and multilevel programming: A bibliography review / rank
 
Normal rank
Property / cites work
 
Property / cites work: A smoothing augmented Lagrangian method for solving simple bilevel programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality conditions for bilevel programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on optimality conditions for bilevel programming problems<sup>∗</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing Projected Gradient Method and Its Application to Stochastic Linear Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4709693 / rank
 
Normal rank

Latest revision as of 15:24, 10 July 2024

scientific article; zbMATH DE number 6469045
Language Label Description Also known as
English
Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
scientific article; zbMATH DE number 6469045

    Statements

    Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 August 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    nonsmooth optimization
    0 references
    constrained optimization
    0 references
    smoothing function
    0 references
    sequential quadratic programming algorithm
    0 references
    bilevel program
    0 references
    constraint qualification
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references