Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
From MaRDI portal
Publication:5501232
Abstract: We consider a degenerate nonsmooth and nonconvex optimization problem for which the standard constraint qualification such as the generalized Mangasarian Fromovitz constraint qualification (GMFCQ) may not hold. We use smoothing functions with the gradient consistency property to approximate the nonsmooth functions and introduce a smoothing sequential quadratic programming (SQP) algorithm under the exact penalty framework. We show that any accumulation point of a selected subsequence of the iteration sequence generated by the smoothing SQP algorithm is a Clarke stationary point, provided that the sequence of multipliers and the sequence of exact penalty parameters are bounded. Furthermore, we propose a new condition called the weakly generalized Mangasarian Fromovitz constraint qualification (WGMFCQ) that is weaker than the GMFCQ. We show that the extended version of the WGMFCQ guarantees the boundedness of the sequence of multipliers and the sequence of exact penalty parameters and thus guarantees the global convergence of the smoothing SQP algorithm. We demonstrate that the WGMFCQ can be satisfied by bilevel programs for which the GMFCQ never holds. Preliminary numerical experiments show that the algorithm is efficient for solving degenerate nonsmooth optimization problem such as the simple bilevel program.
Recommendations
- Solving quadratic convex bilevel programming problems using a smoothing method
- Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
- A smoothing augmented Lagrangian method for nonconvex, nonsmooth constrained programs and its applications to bilevel problems
- A smoothing SQP method for mathematical programs with linear second-order cone complementarity constraints
- A smoothing objective penalty function algorithm for bilevel programming problems
- A smoothing augmented Lagrangian method for solving simple bilevel programs
- scientific article; zbMATH DE number 1053660
- A smoothing QP-free infeasible method for nonlinear inequality constrained optimization
- A smoothing method for solving bilevel multiobjective programming problems
- A superlinear convergent smooth SQP algorithm for mathematical programs with nonlinear equilibrium constraints
Cites work
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 4082855 (Why is no real title available?)
- scientific article; zbMATH DE number 978735 (Why is no real title available?)
- scientific article; zbMATH DE number 1113627 (Why is no real title available?)
- scientific article; zbMATH DE number 1932419 (Why is no real title available?)
- scientific article; zbMATH DE number 3247810 (Why is no real title available?)
- A Global and Local Superlinear Continuation-Smoothing Method forP0andR0NCP or Monotone NCP
- A Robust Algorithm for Optimization with General Equality and Inequality Constraints
- A globally convergent method for nonlinear programming
- A new technique for inconsistent QP problems in the SQP method
- A note on optimality conditions for bilevel programming problems∗
- A recursive quadratic programming algorithm that uses differentiable exact penalty functions
- A robust sequential quadratic programming method
- A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization
- A smoothing SQP method for nonlinear programs with stability constraints arising from power systems
- A smoothing augmented Lagrangian method for solving simple bilevel programs
- An adaptive gradient sampling algorithm for non-smooth optimization
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Bilevel and multilevel programming: A bibliography review
- Convex Analysis
- Epi-convergent smoothing with applications to convex composite functions
- Exact penalty function algorithm with simple updating of the penalty parameter
- Foundations of bilevel programming
- Global convergence of a robust smoothing SQP method for semi-infinite programming
- Gradient consistency for integral-convolution smoothing functions
- Minimizing the Condition Number of a Gram Matrix
- New necessary optimality conditions for bilevel programs by combining the MPEC and value function approaches
- On solving simple bilevel programs with a nonconvex lower level program
- On the numerical solution of a class of Stackelberg problems
- Optimality conditions for bilevel programming problems
- Optimization and nonsmooth analysis
- Practical bilevel optimization. Algorithms and applications
- Projected Sequential Quadratic Programming Methods
- Refinements of necessary optimality conditions in nondifferentiable programming. I
- Revisions of constraint approximations in the successive QP method for nonlinear programming problems
- Robust recursive quadratic programming algorithm model with global and superlinear convergence properties
- Sequential quadratic programming methods
- Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
- Smooth minimization of non-smooth functions
- Smoothing Projected Gradient Method and Its Application to Stochastic Linear Complementarity Problems
- Smoothing methods for convex inequalities and linear complementarity problems
- Smoothing methods for nonsmooth, nonconvex minimization
- Some Feasibility Issues in Mathematical Programs with Equilibrium Constraints
- Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- The Theory of Moral Hazard and Unobservable Behaviour: Part I
- Updating Quasi-Newton Matrices with Limited Storage
- Variational Analysis
Cited in
(19)- A Lagrange multiplier expression method for bilevel polynomial optimization
- Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems
- A two-stage stochastic variational inequality model for storage and dynamic distribution of medical supplies in epidemic management
- An SQP method for minimization of locally Lipschitz functions with nonlinear constraints
- A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective
- Decomposition algorithms for some deterministic and two-stage stochastic single-leader multi-follower games
- Gauss-Newton-type methods for bilevel optimization
- Theoretical and numerical comparison of the Karush-Kuhn-Tucker and value function reformulations in bilevel optimization
- Convexification method for bilevel programs with a nonconvex Follower's problem
- One-Step Estimation with Scaled Proximal Methods
- Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments
- Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability
- A smoothing augmented Lagrangian method for nonconvex, nonsmooth constrained programs and its applications to bilevel problems
- A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization
- An Approximation Scheme for Distributionally Robust Nonlinear Optimization
- An Improved Unconstrained Approach for Bilevel Optimization
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Bilevel polynomial programs and semidefinite relaxation methods
- A partially feasible Jacobi-type distributed SQO method for two-block general linearly constrained smooth optimization
This page was built for publication: Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501232)
