Minimization of Locally Lipschitzian Functions

DOI10.1137/0801006MaRDI QIDQ4017639zbMATHOpenAlexFDO

Authors Jong-Shi Pang, Narayan Rangaraj, Shih-Ping Han

Publication date 16 January 1993

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

Full work available at URL https://doi.org/10.1137/0801006

zbMATH Keywords

minimaxnonsmooth optimizationcomposite optimizationlocally Lipschitzian functionimplicit programmingnonmonotone linesearch techniqueDini stationary points

Mathematics Subject Classification ID

Nonlinear programming (90C30) Nonsmooth analysis (49J52) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• scientific article; zbMATH DE number 22691
• On minimization of locally Lipschitzian functions
• Global convergence of line search method for nonsmooth optimization
• scientific article; zbMATH DE number 940912
• An effective nonsmooth optimization algorithm for locally Lipschitz functions

Cited in

(39)

• scientific article; zbMATH DE number 940912 (Why is no real title available?)
• Manifold sampling for optimizing nonsmooth nonconvex compositions
• Iteration Functions in Some Nonsmooth Optimization Algorithms
• A trust region algorithm for minimization of locally Lipschitzian functions
• Globalizing a nonsmooth Newton method via nonmonotone path search
• A new descent algorithm for solving quadratic bilevel programming problems.
• An effective nonsmooth optimization algorithm for locally Lipschitz functions
• NE/SQP: A robust algorithm for the nonlinear complementarity problem
• scientific article; zbMATH DE number 903080 (Why is no real title available?)
• Optimization problems with equilibrium constraints and their numerical solution.
• Local minimizers of functionals with multiple volume constraints
• Iteration functions in some nonsmooth optimization algorithms
• An SQP method for minimization of locally Lipschitz functions with nonlinear constraints
• Computing optimal incentives via bilevel programming
• Local minima, marginal functions, and separating hyperplanes in discrete optimization
• An extension of the quasi-Newton method for minimizing locally Lipschitz functions
• A syncro-parallel nonsmooth PGD algorithm for nonsmooth optimization
• On superlinear convergence in univariate nonsmooth minimization
• A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints
• Nonmonotone bundle-type scheme for convex nonsmooth minimization
• Local minimizers and rearrangements
• Discrete gradient as applied to the minimization of Lipschitzian functions
• An SQP algorithm for extended linear-quadratic problems in stochastic programming
• On piecewise quadratic Newton and trust region problems
• A trust region algorithm for solving bilevel programming problems
• On an algorithm solving two-level programming problems with nonunique lower level solutions
• Global convergence of line search method for nonsmooth optimization
• A SIMPLE DERIVATION OF SUFFICIENT CONDITIONS FOR A LOCAL MINIMUM OF A LIPSCHITZIAN FUNCTION
• Some brief observations in minimizing the sum of locally Lipschitzian functions
• A numerical approach to optimization problems with variational inequality constraints
• On minimization of locally Lipschitzian functions
• Nonmonotone trust region method for solving optimization problems
• Cost approximation algorithms with nonmonotone line searches for a general class of nonlinear programs
• scientific article; zbMATH DE number 433002 (Why is no real title available?)
• Multistage quadratic stochastic programming
• A globally convergent Newton method for convex \(SC^ 1\) minimization problems
• Nonmonotone stabilization methods for nonlinear equations
• Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
• A trust region method for minimization of nonsmooth functions with linear constraints

This page was built for publication: Minimization of Locally Lipschitzian Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4017639)