On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
From MaRDI portal
Publication:3969459
DOI10.1137/0321010zbMath0503.49021OpenAlexW2056375182MaRDI QIDQ3969459
No author found.
Publication date: 1983
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/c824679aba338408e76790dd9126109911ec02d0
nondifferentiable optimizationmethods of feasible directionsexact penalty function methodslocally functions
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Methods of reduced gradient type (90C52) Mathematical programming (90C99)
Related Items
Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems, An aggregate subgradient method for nonsmooth and nonconvex minimization, Descent methods for composite nondifferentiable optimization problems, A trust region algorithm for minimization of locally Lipschitzian functions, ε-Subdifferential and ε-monotonicity, Exact penalty functions and stability in locally Lipschitz programming, Survey of Bundle Methods for Nonsmooth Optimization, A Method for Minimization of Quasidifferentiable Functions, Exact barrier function methods for Lipschitz programs, A constraint linearization method for nondifferentiable convex minimization, An application-oriented, optimization-based methodology for interactive design of engineering systems†, Optimal scheduling of reservoir releases during flood: Deterministic optimization problem. I: Procedure, A method of linearizations for linearly constrained nonconvex nonsmooth minimization, Descent methods for quasidifferentiable minimization, An algorithm for nondifferentiable optimization, ∊-gradients pour les ponctions localements lipschitziennes et applications, New constructions for local approximation of Lipschitz functions. II, Subgradient projection algorithms for constrained nonsmooth optimization II: nonlinear constraints†, A New Sequential Optimality Condition for Constrained Nonsmooth Optimization, A successive quadratic programming method for a class of constrained nonsmooth optimization problems, Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization, On continuous codifferentiability of quasidifferentiable functions, An adaptive competitive penalty method for nonsmooth constrained optimization, Exact penalization via dini and hadamard conditional derivatives, Continuous approximations to generalized jacobians, Exact penalty functions and Lagrange multipliers, Lagrangian globalization methods for nonlinear complementarity problems, Point-Based Set-Valued Approximations, C -Differential Operators and Applications, Conditional subgradient optimization -- theory and applications, Stochastic approximation algorithm for minimax problems, An approach for robust PDE-constrained optimization with application to shape optimization of electrical engines and of dynamic elastic structures under uncertainty, Outer approximation algorithm for nondifferentiable optimization problems, An algorithm for minimizing a class of locally Lipschitz functions, Nondifferentiable optimization algorithm for designing control systems having singular value inequalities, Nondifferential optimization via adaptive smoothing, On the optimal design centering, tolerancing, and tuning problem, A method for minimizing the sum of a convex function and a continuously differentiable function, Application of the successive relaxation method to solve extremal problems with semismooth functions, Algorithms for optimization problems with exclusion constraints, Trajectory-following algorithms for min-max optimization problems
