Algorithm Models for Nondifferentiable Optimization
DOI10.1137/0323031zbMATH Open0569.90073OpenAlexW2177588300MaRDI QIDQ3686441FDOQ3686441
Authors: Elijah Polak, D. Q. Mayne
Publication date: 1985
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0323031
Recommendations
generalized gradientsalgorithm theorynondifferentiable optimizationsemi-infinite optimizationfeasible directions
Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Semi-infinite programming (90C34)
Cited In (26)
- Title not available (Why is that?)
- A multi-step curve search algorithm in nonlinear optimization: nondifferentiable convex case
- Modélisation d'algorithmes d'optimisation à stratégie aléatoire. (Modelling random search optimization algorithms)
- A Method for Minimization of Quasidifferentiable Functions
- A method for minimizing convex functions based on continuous approximations to the subdifferential
- Optimal scheduling of reservoir releases during flood: Deterministic optimization problem. I: Procedure
- An algorithm for nondifferentiable optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms for solving nonlinear dynamic decision models
- On minimax eigenvalue problems via constrained optimization
- Algorithms for optimization problems with exclusion constraints
- A Newton's method for perturbed second-order cone programs
- Optimisation impossible
- Title not available (Why is that?)
- Algorithm 811: NDA
- Title not available (Why is that?)
- An algorithm for minimizing a class of locally Lipschitz functions
- Subgradient projection algorithms for constrained nonsmooth optimization II: nonlinear constraints†
- Nondifferentiable optimization via smooth approximation: General analytical approach
- Choice of a step-length in an almost everywhere differentiable (on every direction) (almost everywhere locally lipschitz) lower-semi-continuous minimization problem
- Title not available (Why is that?)
- Algorithms of nondifferentiable optimization: development and application
- Title not available (Why is that?)
- Algorithms for construction of efficient frontier for nonconvex models on the basis of optimization methods
- Continuous approximations to generalized jacobians
This page was built for publication: Algorithm Models for Nondifferentiable Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3686441)