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