Methods of descent for nondifferentiable optimization

DOI10.1007/BFb0074500zbMath0561.90059OpenAlexW4212912562MaRDI QIDQ2266668

Krzysztof C. Kiwiel

Publication date: 1985

Published in: Lecture Notes in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0074500

zbMATH Keywords

numerical methodssubgradient methodsmethods of descentnondifferential optimizationLocally Lipschitz functionsnonsmooth) optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items

\(\varepsilon\)-subgradient algorithms for locally Lipschitz functions on Riemannian manifolds, An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems, Nonmonotone stabilization methods for nonlinear equations, 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, A gradient sampling method based on ideal direction for solving nonsmooth optimization problems, Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems, On constraint qualifications and sensitivity analysis for general optimization problems via pseudo-Jacobians, A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems, Finite master programs in regularized stochastic decomposition, Decomposition approaches for constrained spatial auction market problems, Approximations in proximal bundle methods and decomposition of convex programs, A heuristic for the stability number of a graph based on convex quadratic programming and tabu search, Optimization with nonsmooth data, Nonconvex bundle method with application to a delamination problem, Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization, A constraint linearization method for nondifferentiable convex minimization, Extension of some results for channel capacity using a generalized information measure, Constraint aggregation principle in convex optimization, Convergence and computational analyses for some variable target value and subgradient deflection methods, Solving nonlinear multicommodity flow problems by the analytic center cutting plane method, On bilevel programming. I: General nonlinear cases, Optimal prestress of structures with frictional unilateral contact interfaces, On numerical solution of hemivariational inequalities by nonsmooth optimization methods, Descent methods for quasidifferentiable minimization, Decomposition methods in stochastic programming, Algorithms for the solution of stochastic dynamic minimax problems, Subgradient method for nonconvex nonsmooth optimization, Globally convergent limited memory bundle method for large-scale nonsmooth optimization, A generalized subgradient method with relaxation step, Smooth transformation of the generalized minimax problem, The proximal Chebychev center cutting plane algorithm for convex additive functions, A quasi-second-order proximal bundle algorithm, On approximations with finite precision in bundle methods for nonsmooth optimization, A hybrid approach of bundle and Benders applied large mixed linear integer problem, Method of simple-body centroids, Solving generation expansion planning problems with environmental constraints by a bundle method, A proximal bundle method with inexact data for convex nondifferentiable minimization, Nonsmooth optimization via quasi-Newton methods, Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities, Complementary finite-element method for finite deformation nonsmooth mechanics, A feasible directions method for nonsmooth convex optimization, PyOpt: a python-based object-oriented framework for nonlinear constrained optimization, Approximation of the critical buckling factor for composite panels, A method for convex minimization based on translated first-order approximations, A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization, Scenario decomposition of risk-averse multistage stochastic programming problems, Descent algorithm for nonsmooth stochastic multiobjective optimization, An effective nonsmooth optimization algorithm for locally Lipschitz functions, Generalized order-value optimization, A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees, An additive subfamily of enlargements of a maximally monotone operator, An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness, A partially inexact bundle method for convex semi-infinite minmax problems, Regularization methods for optimization problems with probabilistic constraints, A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information, Proximity control in bundle methods for convex nondifferentiable minimization, A new proximal Chebychev center cutting plane algorithm for nonsmooth optimization and its convergence, An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems, On Nesterov's nonsmooth Chebyshev-Rosenbrock functions, A variable target value method for nondifferentiable optimization, Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs, A primal-dual aggregation algorithm for minimizing conditional value-at-risk in linear programs, Generalized derivatives for solutions of parametric ordinary differential equations with non-differentiable right-hand sides, Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization, A cutting plane projection method for bi-level area traffic control optimization with uncertain travel demand, Diagonal bundle method for nonsmooth sparse optimization, Reverse propagation of McCormick relaxations, Discrete gradient method: Derivative-free method for nonsmooth optimization, A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization, A feasible point method with bundle modification for nonsmooth convex constrained optimization, Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems, Differentiable McCormick relaxations, Aggregate subgradient method for nonsmooth DC optimization, A spline smoothing Newton method for finite minimax problems, A smooth method for the finite minimax problem, A bundle-filter method for nonsmooth convex constrained optimization, An adaptive competitive penalty method for nonsmooth constrained optimization, A fast gradient and function sampling method for finite-max functions, Globally convergent cutting plane method for nonconvex nonsmooth minimization, Nondifferentiable optimization via smooth approximation: General analytical approach, Smoothing methods for nonsmooth, nonconvex minimization, A filter proximal bundle method for nonsmooth nonconvex constrained optimization, Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization, Generalized derivatives of differential-algebraic equations, Convergent Lagrangian and domain cut method for nonlinear knapsack problems, Globally convergent variable metric method for convex nonsmooth unconstrained minimization, A proximal cutting plane method using Chebychev center for nonsmooth convex optimization, An inexact bundle variant suited to column generation, Convergence analysis of some methods for minimizing a nonsmooth convex function, Computational schemes for large-scale problems in extended linear- quadratic programming, Generalized pattern search methods for a class of nonsmooth optimization problems with structure, Efficiency of proximal bundle methods, A bundle-Newton method for nonsmooth unconstrained minimization, Feasible direction algorithm for optimal control problems with state and control constraints: Implementation, A regularized stochastic decomposition algorithm for two-stage stochastic linear programs, Convergence properties of a conditional \(\varepsilon\)-subgradient method applied to linear programs, New variable-metric algorithms for nondifferentiable optimization problems, Nonmonotone bundle-type scheme for convex nonsmooth minimization, A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations, A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods, A gradient sampling algorithm for stratified maps with applications to topological data analysis, A version of bundle trust region method with linear programming, Analyzing the Influence of Agents in Trust Networks: Applying Nonsmooth Eigensensitivity Theory to a Graph Centrality Problem, Optimal Convergence Rates for the Proximal Bundle Method, A new nonmonotone line search method for nonsmooth nonconvex optimization, A modified subgradient algorithm for Lagrangean relaxation, Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization, Composite nonsmooth optimization using approximate generalized gradient vectors, A proximal bundle method for nonsmooth nonconvex functions with inexact information, Essentials of numerical nonsmooth optimization, Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems, Essentials of numerical nonsmooth optimization, A Proximal Bundle Method with Exact Penalty Technique and Bundle Modification Strategy for Nonconvex Nonsmooth Constrained Optimization, Deterministic methods in constrained global optimization: Some recent advances and new fields of application, The Mordukhovich subdifferentials and directions of descent, Topology optimization of periodic microstructures with a penalization of highly localized buckling modes, Comparing different nonsmooth minimization methods and software, A method for non-differentiable optimization problems, Generalized derivatives of computer programs, Subgradient method with feasible inexact projections for constrained convex optimization problems, A primal-dual algorithm for risk minimization, Tuning strategy for the proximity parameter in convex minimization, ON PORTFOLIO SELECTION UNDER EXTREME RISK MEASURE: THE HEAVY-TAILED ICA MODEL, Averaged Subgradient Methods for Constrained Convex Optimization and Nash Equilibria Computation, Survey of Bundle Methods for Nonsmooth Optimization, A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions, Non-convex multiobjective optimization under uncertainty: a descent algorithm. Application to sandwich plate design and reliability, A vector forward mode of automatic differentiation for generalized derivative evaluation, An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems, Generalized derivatives of eigenvalues of a symmetric matrix, A method of linearizations for linearly constrained nonconvex nonsmooth minimization, Dynamic bundle methods, A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition, An algorithm for minimizing clustering functions, Two adaptively stepped monotone algorithms for solving discounted dynamic programming equations, A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes, On the numerical solution of a class of Stackelberg problems, An optimization approach to robust nonlinear control design, Generalization of hyperbolic smoothing approach for non-smooth and non-Lipschitz functions, Theory of index-one nonlinear complementarity systems, Rate of convergence of the bundle method, Interpolation of Functions with Parameter Dependent Jumps by Transformed Snapshots, A simple version of bundle method with linear programming, Numerical infinitesimals in a variable metric method for convex nonsmooth optimization, Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs, Limited memory interior point bundle method for large inequality constrained nonsmooth minimization, A practicable way for computing the directional derivative of the optimal value function in convex programming, A Support Function Based Algorithm for Optimization with Eigenvalue Constraints, Two-stage time-optimal formation reconfiguration strategy, A subgradient method with non-monotone line search, A new steepest descent differential inclusion-based method for solving general nonsmooth convex optimization problems, Transformed Snapshot Interpolation with High Resolution Transforms, Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization, Designing a minimal spanning tree network subject to a budget constraint, On the global convergence of a nonmonotone proximal bundle method for convex nonsmooth minimization, Interactive bundle-based method for nondifferentiable multiobjeective optimization: nimbus^§, Nonsmooth DAEs with Applications in Modeling Phase Changes, Unnamed Item, Generalized sensitivity analysis of nonlinear programs using a sequence of quadratic programs, An SL/QP Algorithm for Minimizing the Spectral Abscissa of Time Delay Systems, Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization, Comparison of bundle and classical column generation, A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs, An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization, Global non-smooth optimization in robust multivariate regression, Minimization of marginal functions in mathematical programming based on continuous outer subdifferentials, The chain rule for VU-decompositions of nonsmooth functions, Facility location via continuous optimization with discontinuous objective functions, A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions, On parametric nonlinear programming, An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space, Continuous approximations to generalized jacobians, Computationally relevant generalized derivatives: theory, evaluation and applications, Branch-locking AD techniques for nonsmooth composite functions and nonsmooth implicit functions, An efficient descent method for locally Lipschitz multiobjective optimization problems, Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming, A trust region algorithm for constrained optimization, Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions, Two-Stage Optimization Problems with Multivariate Stochastic Order Constraints, A quasi-Newton method for unconstrained non-smooth problems, Analysis of the gradient method with an Armijo–Wolfe line search on a class of non-smooth convex functions, Computation of maximal turning points to nonlinear equations by nonsmooth optimization, A representation of generalized convex polyhedra and applications, A non-monotone conjugate subgradient type method for minimization of convex functions, An implementation of a reduced subgradient method via Luenberger-Mokhtar variant, Diagonal discrete gradient bundle method for derivative free nonsmooth optimization, A proximal-projection partial bundle method for convex constrained minimax problems, On the differentiability check in gradient sampling methods, Unnamed Item, Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs, A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems, Subgradient and Bundle Methods for Nonsmooth Optimization, Hyperbolic smoothing function method for minimax problems, A new restricted memory level bundle method for constrained convex nonsmooth optimization, Convex optimization by radial search, Random perturbation of the projected variable metric method for nonsmooth nonconvex optimization problems with linear constraints, An algorithm for minimizing a class of locally Lipschitz functions, Continuous outer subdifferentials in nonsmooth optimization, A geometric integration approach to nonsmooth, nonconvex optimisation, Manifold Sampling for $\ell_1$ Nonconvex Optimization, Weak subgradient method for solving nonsmooth nonconvex optimization problems, An aggregate homotopy method for solving unconstrained minimax problems, Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods, Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods, A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems, Algorithms for Simple Bilevel Programming, Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition, Non-smooth optimization based on resilient backpropagation search for unconstrained and simply bounded problems, An adaptive gradient sampling algorithm for non-smooth optimization, Unnamed Item, A Selective Linearization Method For Multiblock Convex Optimization, A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles, Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization