Methods of descent for nondifferentiable optimization
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A generalized subgradient method with relaxation step
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
- An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems
- Continuous approximations to generalized jacobians
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- Two-stage optimization problems with multivariate stochastic order constraints
- scientific article; zbMATH DE number 4035561 (Why is no real title available?)
- A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems
- Hyperbolic smoothing function method for minimax problems
- Essentials of numerical nonsmooth optimization
- Nonconvex bundle method with application to a delamination problem
- Descent gradient methods for nonsmooth minimization problems in ill-posed problems
- Trust-region methods for the derivative-free optimization of nonsmooth black-box functions
- Constraint aggregation principle in convex optimization
- Two-stage time-optimal formation reconfiguration strategy
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
- An efficient descent method for locally Lipschitz multiobjective optimization problems
- A gradient sampling method based on ideal direction for solving nonsmooth optimization problems
- Survey of Bundle Methods for Nonsmooth Optimization
- Algorithms for the solution of stochastic dynamic minimax problems
- Continuous outer subdifferentials in nonsmooth optimization
- Nonsmooth optimization via quasi-Newton methods
- Optimization with nonsmooth data
- Feasible direction algorithm for optimal control problems with state and control constraints: Implementation
- A representation of generalized convex polyhedra and applications
- Analysis of the gradient method with an Armijo-Wolfe line search on a class of non-smooth convex functions
- Approximations in proximal bundle methods and decomposition of convex programs
- Descent methods for composite nondifferentiable optimization problems
- -subgradient algorithms for locally Lipschitz functions on Riemannian manifolds
- Aggregate subgradient method for nonsmooth DC optimization
- On approximations with finite precision in bundle methods for nonsmooth optimization
- On the global convergence of a nonmonotone proximal bundle method for convex nonsmooth minimization
- Decomposition approaches for constrained spatial auction market problems
- Optimal Convergence Rates for the Proximal Bundle Method
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- A selective linearization method for multiblock convex optimization
- Interpolation of functions with parameter dependent jumps by transformed snapshots
- Proximity control in bundle methods for convex nondifferentiable minimization
- Modified gradient sampling algorithm for nonsmooth semi-infinite programming
- Generalized pattern search methods for a class of nonsmooth optimization problems with structure
- A heuristic for the stability number of a graph based on convex quadratic programming and tabu search
- Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization
- scientific article; zbMATH DE number 50615 (Why is no real title available?)
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
- Global solutions to nonconvex optimization of 4th-order polynomial and log-sum-exp functions
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
- Limited memory interior point bundle method for large inequality constrained nonsmooth minimization
- Numerical infinitesimals in a variable metric method for convex nonsmooth optimization
- Descent methods for quasidifferentiable minimization
- A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles
- Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
- On the numerical solution of a class of Stackelberg problems
- A bundle-filter method for nonsmooth convex constrained optimization
- Inexact Newton method for solving generalized Nash equilibrium problems
- Convergence analysis of some methods for minimizing a nonsmooth convex function
- Non-smooth optimization based on resilient backpropagation search for unconstrained and simply bounded problems
- A bundle-Newton method for nonsmooth unconstrained minimization
- A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- A modified subgradient algorithm for Lagrangean relaxation
- On parametric nonlinear programming
- Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- Averaged Subgradient Methods for Constrained Convex Optimization and Nash Equilibria Computation
- A fast gradient and function sampling method for finite-max functions
- Essentials of numerical nonsmooth optimization
- Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
- A feasible point method with bundle modification for nonsmooth convex constrained optimization
- scientific article; zbMATH DE number 3912124 (Why is no real title available?)
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- A quasi-Newton method for unconstrained non-smooth problems
- A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions
- A subgradient method with non-monotone line search
- An SL/QP algorithm for minimizing the spectral abscissa of time delay systems
- Double bundle method for finding Clarke stationary points in nonsmooth DC programming
- Subgradient method with feasible inexact projections for constrained convex optimization problems
- Extension of some results for channel capacity using a generalized information measure
- Duality results and dual bundle methods based on the dual method of centers for minimax fractional programs
- Random perturbation of the projected variable metric method for nonsmooth nonconvex optimization problems with linear constraints
- A primal-dual algorithm for risk minimization
- A filter proximal bundle method for nonsmooth nonconvex constrained optimization
- A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions
- Generalized derivatives of computer programs
- A gradient sampling algorithm for stratified maps with applications to topological data analysis
- An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization
- A practicable way for computing the directional derivative of the optimal value function in convex programming
- Subgradient and bundle methods for nonsmooth optimization
- A constraint linearization method for nondifferentiable convex minimization
- A two-phase bundle method with bundle modification for nonsmooth constrained optimization
- Two adaptively stepped monotone algorithms for solving discounted dynamic programming equations
- A proximal bundle method with exact penalty technique and bundle modification strategy for nonconvex nonsmooth constrained optimization
- Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization
- An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space
- scientific article; zbMATH DE number 2133301 (Why is no real title available?)
- Generalized derivatives of differential-algebraic equations
This page was built for publication: Methods of descent for nondifferentiable optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2266668)
