Minimization of Locally Lipschitzian Functions
DOI10.1137/0801006zbMATH Open0752.90070OpenAlexW1978001564MaRDI QIDQ4017639FDOQ4017639
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
Recommendations
minimaxnonsmooth optimizationcomposite optimizationlocally Lipschitzian functionimplicit programmingnonmonotone linesearch techniqueDini stationary points
Nonlinear programming (90C30) Nonsmooth analysis (49J52) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cited In (36)
- Globalizing a nonsmooth Newton method via nonmonotone path search
- Local minima, marginal functions, and separating hyperplanes in discrete optimization
- A numerical approach to optimization problems with variational inequality constraints
- On minimization of locally Lipschitzian functions
- Title not available (Why is that?)
- An SQP algorithm for extended linear-quadratic problems in stochastic programming
- A trust region algorithm for minimization of locally Lipschitzian functions
- Global convergence of line search method for nonsmooth optimization
- NE/SQP: A robust algorithm for the nonlinear complementarity problem
- Local minimizers of functionals with multiple volume constraints
- Local minimizers and rearrangements
- Optimization problems with equilibrium constraints and their numerical solution.
- Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions
- A trust region method for minimization of nonsmooth functions with linear constraints
- Iteration Functions in Some Nonsmooth Optimization Algorithms
- Nonmonotone trust region method for solving optimization problems
- An effective nonsmooth optimization algorithm for locally Lipschitz functions
- A SIMPLE DERIVATION OF SUFFICIENT CONDITIONS FOR A LOCAL MINIMUM OF A LIPSCHITZIAN FUNCTION
- 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
- Computing optimal incentives via bilevel programming
- On piecewise quadratic Newton and trust region problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints
- On superlinear convergence in univariate nonsmooth minimization
- Multistage quadratic stochastic programming
- Nonmonotone bundle-type scheme for convex nonsmooth minimization
- A syncro-parallel nonsmooth PGD algorithm for nonsmooth optimization
- Discrete gradient as applied to the minimization of Lipschitzian functions
- Iteration functions in some nonsmooth optimization algorithms
- On an algorithm solving two-level programming problems with nonunique lower level solutions
- Cost approximation algorithms with nonmonotone line searches for a general class of nonlinear programs
- A trust region algorithm for solving bilevel programming problems
- A new descent algorithm for solving quadratic bilevel programming problems.
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)
