A quadratic approximation method for minimizing a class of quasidifferentiable functions
From MaRDI portal
An unconstrained nonlinear programming problem with nondifferentiabilities is considered. The nondifferentiabilities arise from terms of the form \(\max [f_ 1(x),...,f_ n(x)]\), which may enter nonlinearly in the objective function. Local convex polyhedral upper approximations to the objective function are introduced. These approximations are used in an iterative method for solving the problem. The algorithm proceeds by solving quadratic programming subproblems to generate search directions. Approximate line searches ensure global convergence of the method to stationary points. The algorithm is conceptually simple and easy to implement. It generalizes efficient variable metric methods for minimax calculations.
Recommendations
- Quadratic Approximations in Convex Nondifferentiable Optimization
- A solution method for a special class of nondifferentiable unconstrained optimization problems
- A direct method of linearization for continuous minimax problems
- A linearization method for minimizing certain quasidifferentiable functions
- scientific article; zbMATH DE number 1283849
Cites work
- A globally convergent method for nonlinear programming
- A model algorithm for composite nondifferentiable optimization problems
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- A Penalty Function Method Converging Directly to a Constrained Optimum
- Algorithms for a class of nondifferentiable problems
- Algorithms for nonlinear constraints that use lagrangian functions
- An Algorithm for l₁ -Norm Minimization with Application to Nonlinear l₁ -Approximation
- Approximation procedures based on the method of multipliers
- Convex Analysis
- Exact penalty functions in nonlinear programming
- Generalized Gradients and Applications
- Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions
- scientific article; zbMATH DE number 3916028 (Why is no real title available?)
- scientific article; zbMATH DE number 3722433 (Why is no real title available?)
- scientific article; zbMATH DE number 3727523 (Why is no real title available?)
- scientific article; zbMATH DE number 3744430 (Why is no real title available?)
- scientific article; zbMATH DE number 3595804 (Why is no real title available?)
- scientific article; zbMATH DE number 3407464 (Why is no real title available?)
- Linearly constrained minimax optimization
- Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems
- Optimization and nonsmooth analysis
- Stationarity and superlinear convergence of an algorithm for univariate locally lipschitz constrained minimization
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- The watchdog technique for forcing convergence in algorithms for constrained optimization
- Variable metric methods for minimizing a class of nondifferentiable functions
Cited in
(21)- Descent methods for quasidifferentiable minimization
- Descent algorithm for a class of convex nondifferentiable functions
- Smooth transformation of the generalized minimax problem
- Quasifractional approximants for matching small and large \(\delta\) approaches
- A direct method of linearization for continuous minimax problems
- A solution method for a special class of nondifferentiable unconstrained optimization problems
- A minimizing algorithm for complex nonconvex nondifferentiable functions
- The quadratic functional as an indicator of the convergence of approximate methods
- scientific article; zbMATH DE number 3896697 (Why is no real title available?)
- A linearization method for minimizing certain quasidifferentiable functions
- On the minimization of a quasidifferentiable function subject to equality-type quasidifferentiable constraints
- An algorithm for minimizing a certain class of quasidifferentiable functions
- scientific article; zbMATH DE number 4007605 (Why is no real title available?)
- Randomized search directions in descent methods for minimizing certain quasidifferentiable functions
- Quadratic Approximations in Convex Nondifferentiable Optimization
- The method of common descent for a certain class of quasidifferentiable functions
- scientific article; zbMATH DE number 58789 (Why is no real title available?)
- scientific article; zbMATH DE number 1283849 (Why is no real title available?)
- scientific article; zbMATH DE number 1759565 (Why is no real title available?)
- scientific article; zbMATH DE number 1911050 (Why is no real title available?)
- On exact linesearch quasi-Newton methods for minimizing a quadratic function
This page was built for publication: A quadratic approximation method for minimizing a class of quasidifferentiable functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1063391)
