An Algorithm for Constrained Optimization with Semismooth Functions
From MaRDI portal
Publication:4178793
DOI10.1287/moor.2.2.191zbMath0395.90069OpenAlexW1964244351MaRDI QIDQ4178793
Publication date: 1977
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: http://pure.iiasa.ac.at/id/eprint/712/1/RR-77-003.pdf
Related Items (77)
Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder) ⋮ Descent methods for composite nondifferentiable optimization problems ⋮ Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization ⋮ A nonsmooth version of Newton's method ⋮ Links between functions and subdifferentials ⋮ The bundle scheme for solving arbitrary eigenvalue optimizations ⋮ An Inexact Bundle Method and Subgradient Computations for Optimal Control of Deterministic and Stochastic Obstacle Problems ⋮ A subgradient selection method for minimizing convex functions subject to linear constraints ⋮ Generalized gradients and paths of descent ⋮ Survey of Bundle Methods for Nonsmooth Optimization ⋮ A constraint linearization method for nondifferentiable convex minimization ⋮ Semismoothness and decomposition of maximal normal operators ⋮ Optimal scheduling of reservoir releases during flood: Deterministic optimization problem. I: Procedure ⋮ Convergence and computational analyses for some variable target value and subgradient deflection methods ⋮ A method of linearizations for linearly constrained nonconvex nonsmooth minimization ⋮ A trust region target value method for optimizing nondifferentiable Lagrangian duals of linear programs ⋮ Piecewise linear approximations in nonconvex nonsmooth optimization ⋮ Extended semismooth Newton method for functions with values in a cone ⋮ A variable metric method for nonsmooth convex constrained optimization ⋮ Smooth transformation of the generalized minimax problem ⋮ Approximating Clarke's subgradients of semismooth functions by divided differences ⋮ Nonsmooth optimization via quasi-Newton methods ⋮ Optimistic planning algorithms for state-constrained optimal control problems ⋮ A method for convex minimization based on translated first-order approximations ⋮ A minimization method for the sum of a convex function and a continuously differentiable function ⋮ A gradient sampling algorithm for stratified maps with applications to topological data analysis ⋮ An effective nonsmooth optimization algorithm for locally Lipschitz functions ⋮ A hierarchy of spectral relaxations for polynomial optimization ⋮ Semismoothness for Solution Operators of Obstacle-Type Variational Inequalities with Applications in Optimal Control ⋮ Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs ⋮ Optimal Convergence Rates for the Proximal Bundle Method ⋮ The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches ⋮ A maximization method for a class of quasiconcave programs ⋮ A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees ⋮ A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities ⋮ A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information ⋮ Convergence of relaxation methods for nondifferentiable constrained optimization ⋮ Discrete minimax problem: Algorithms and numerical comparisons ⋮ Line Search Algorithms for Locally Lipschitz Functions on Riemannian Manifolds ⋮ Generalized gradients in dynamic optimization, optimal control, and machine learning problems ⋮ An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems ⋮ Analysis of symmetric matrix valued functions. I ⋮ Weak directional closedness and generalized subdifferentials ⋮ Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs ⋮ Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization ⋮ Discrete gradient method: Derivative-free method for nonsmooth optimization ⋮ 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 ⋮ An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization ⋮ A descent algorithm for nonsmooth convex optimization ⋮ An aggregate subgradient method for nonsmooth convex minimization ⋮ Algorithms and application for special classes of nonlinear least squares problems ⋮ A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization ⋮ Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem ⋮ On parametric nonlinear programming ⋮ On a class of nonsmooth optimal control problems ⋮ Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming ⋮ A filter-variable-metric method for nonsmooth convex constrained optimization ⋮ A subgradient algorithm for certain minimax and minisum problems ⋮ The maximal normal operator space and integration of subdifferentials of nonconvex functions ⋮ An inexact bundle variant suited to column generation ⋮ Stochastic generalized gradient methods for training nonconvex nonsmooth neural networks ⋮ Unnamed Item ⋮ Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs ⋮ Approximate discrete maximum principle for the difference approximation of optimal periodic control problems ⋮ A generalized proximal point algorithm for certain non-convex minimization problems ⋮ An algorithm for minimizing a class of locally Lipschitz functions ⋮ Nondifferentiable optimization algorithm for designing control systems having singular value inequalities ⋮ Optimization of upper semidifferentiable functions ⋮ An efficient algorithm for solving the discrete minisum 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 ⋮ A regularized stochastic decomposition algorithm for two-stage stochastic linear programs ⋮ Descent algorithm for a class of convex nondifferentiable functions ⋮ Nonmonotone bundle-type scheme for convex nonsmooth minimization ⋮ ε-Optimal solutions in nondifferentiable convex programming and some related questions
This page was built for publication: An Algorithm for Constrained Optimization with Semismooth Functions
