Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs

DOI10.1137/140971580zbMath1317.65148arXiv1403.1636OpenAlexW2964280104MaRDI QIDQ5501232

Jane J. Ye, Mengwei Xu, Li-wei Zhang

Publication date: 3 August 2015

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.1636

zbMATH Keywords

nonsmooth optimizationconstrained optimizationconstraint qualificationsmoothing functionbilevel programsequential quadratic programming algorithm

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)

Related Items (17)

Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments ⋮ Bilevel Polynomial Programs and Semidefinite Relaxation Methods ⋮ An Improved Unconstrained Approach for Bilevel Optimization ⋮ A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective ⋮ A two-stage stochastic variational inequality model for storage and dynamic distribution of medical supplies in epidemic management ⋮ Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability ⋮ An Approximation Scheme for Distributionally Robust Nonlinear Optimization ⋮ An SQP method for minimization of locally Lipschitz functions with nonlinear constraints ⋮ Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems ⋮ A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization ⋮ 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 ⋮ A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ One-Step Estimation with Scaled Proximal Methods

Uses Software

• L-BFGS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smooth minimization of non-smooth functions
• A smoothing SQP method for nonlinear programs with stability constraints arising from power systems
• Gradient consistency for integral-convolution smoothing functions
• Smoothing methods for nonsmooth, nonconvex minimization
• A smoothing augmented Lagrangian method for solving simple bilevel programs
• A globally convergent method for nonlinear programming
• Refinements of necessary optimality conditions in nondifferentiable programming. I
• A new technique for inconsistent QP problems in the SQP method
• Practical bilevel optimization. Algorithms and applications
• Bilevel and multilevel programming: A bibliography review
• Robust recursive quadratic programming algorithm model with global and superlinear convergence properties
• Foundations of bilevel programming
• A robust sequential quadratic programming method
• Smoothing methods for convex inequalities and linear complementarity problems
• Exact penalty function algorithm with simple updating of the penalty parameter
• Global convergence of a robust smoothing SQP method for semi-infinite programming
• On solving simple bilevel programs with a nonconvex lower level program
• Epi-convergent Smoothing with Applications to Convex Composite Functions
• An adaptive gradient sampling algorithm for non-smooth optimization
• Sequential Quadratic Programming Methods
• A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization
• Minimizing the Condition Number of a Gram Matrix
• New Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches
• On the numerical solution of a class of Stackelberg problems
• Smoothing Projected Gradient Method and Its Application to Stochastic Linear Complementarity Problems
• Revisions of constraint approximations in the successive QP method for nonlinear programming problems
• Optimization and nonsmooth analysis
• A recursive quadratic programming algorithm that uses differentiable exact penalty functions
• Updating Quasi-Newton Matrices with Limited Storage
• Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
• Superlinearly convergent variable metric algorithms for general nonlinear programming problems
• Some Feasibility Issues in Mathematical Programs with Equilibrium Constraints
• The Theory of Moral Hazard and Unobservable Behaviour: Part I
• A note on optimality conditions for bilevel programming problems^∗
• Variational Analysis
• Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
• A Robust Algorithm for Optimization with General Equality and Inequality Constraints
• A Global and Local Superlinear Continuation-Smoothing Method forP₀andR₀NCP or Monotone NCP
• Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
• Optimality conditions for bilevel programming problems
• Projected Sequential Quadratic Programming Methods
• Convex Analysis

This page was built for publication: Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs