scientific article; zbMATH DE number 3577030
From MaRDI portal
Publication:4146571
zbMath0369.90093MaRDI QIDQ4146571
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder) ⋮ An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems ⋮ Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization ⋮ A problem in parametric programming ⋮ Extensions of subgradient projection algorithms ⋮ A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems ⋮ A generalized iterative scheme for network design problem ⋮ Penalty-proximal methods in convex programming ⋮ A subgradient selection method for minimizing convex functions subject to linear constraints ⋮ On Lipschitz optimization based on gray-box piecewise linearization ⋮ On some difficult linear programs coming from set partitioning ⋮ Improving feasible directions for a class of nondifferentiable functions ⋮ Computational efficiency of the simplex embedding method in convex nondifferentiable optimization ⋮ Extension of some results for channel capacity using a generalized information measure ⋮ A Newton's method for perturbed second-order cone programs ⋮ Optimal scheduling of reservoir releases during flood: Deterministic optimization problem. I: Procedure ⋮ Piecewise linear approximations in nonconvex nonsmooth optimization ⋮ Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs ⋮ An optimal variant of Kelley's cutting-plane method ⋮ \(\epsilon\)-subgradient projection algorithm ⋮ Theorems of the alternative and duality ⋮ A general method of finding the direction of descent in \(\varepsilon\)-subgradient methods ⋮ Sublinear upper bounds for stochastic programs with recourse ⋮ Approximation of the steepest descent direction for the O-D matrix adjustment problem ⋮ A bundle modification strategy for convex minimization ⋮ Smooth transformation of the generalized minimax problem ⋮ A derivative-free approximate gradient sampling algorithm for finite minimax problems ⋮ Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization ⋮ A quasi-second-order proximal bundle algorithm ⋮ A hybrid approach of bundle and Benders applied large mixed linear integer problem ⋮ Application of the method of conjugate subgradients to minimization of quasiconvex functions ⋮ An approximate quasi-Newton bundle-type method for nonsmooth optimization ⋮ A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems ⋮ A combined relaxation method for variational inequalities with nonlinear constraints ⋮ Nonsmooth optimization via quasi-Newton methods ⋮ New variants of bundle methods ⋮ A multi-step doubly stabilized bundle method for nonsmooth convex optimization ⋮ A descent method with linear programming subproblems for nondifferentiable convex optimization ⋮ A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization ⋮ A globally convergent iterative scheme for toll design network with signal settings ⋮ Reflections on nondifferentiable optimization. I: Ball gradient ⋮ Reflections on nondifferentiable optimization. II: Convergence ⋮ 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 simple version of bundle method with linear programming ⋮ An effective nonsmooth optimization algorithm for locally Lipschitz functions ⋮ On the computational efficiency of subgradient methods: a case study with Lagrangian bounds ⋮ A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees ⋮ An implementable algorithm for the optimal design centering, tolerancing, and tuning problem ⋮ A partially inexact bundle method for convex semi-infinite minmax problems ⋮ A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information ⋮ A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem ⋮ Successive relaxation method for minimization of functionals and some efficiency estimates ⋮ A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem ⋮ A subgradient projection algorithm ⋮ Adjustment of O-D trip matrices from observed volumes: an algorithmic approach based on conjugate directions. ⋮ The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients ⋮ Large-scale unit commitment under uncertainty: an updated literature survey ⋮ A conceptual conjugate epi-projection algorithm of convex optimization: superlinear, quadratic and finite convergence ⋮ Level-set methods for convex optimization ⋮ An efficient search algorithm for road network optimization ⋮ Discrete gradient method: Derivative-free method for nonsmooth optimization ⋮ A feasible point method with bundle modification for nonsmooth convex constrained optimization ⋮ A smooth method for the finite minimax problem ⋮ A fast space-decomposition scheme for nonconvex eigenvalue optimization ⋮ An adaptive competitive penalty method for nonsmooth constrained optimization ⋮ A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs ⋮ Simultaneously optimizing link tolls and signal settings in a road network ⋮ Benefit sharing in holding situations ⋮ Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints ⋮ Near-optimal solutions to large-scale facility location problems ⋮ Optimal atomic-resolution structures of prion AGAAAAGA amyloid fibrils ⋮ An optimization model for area traffic control with link tolls ⋮ Semisupervised spherical separation ⋮ Optimization for signal setting problems using non-smooth techniques ⋮ Optimization of limited network capacity with toll settings ⋮ A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality ⋮ Synthesis of cutting and separating planes in a nonsmooth optimization method ⋮ A non-monotone conjugate subgradient type method for minimization of convex functions ⋮ A method of conjugate subgradients for minimization of functionals ⋮ A non-smooth model for signalized road network design problems ⋮ A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems ⋮ Efficiency of proximal bundle methods ⋮ A new restricted memory level bundle method for constrained convex nonsmooth optimization ⋮ Continuous outer subdifferentials in nonsmooth optimization ⋮ Optimization of upper semidifferentiable functions ⋮ On a space extension algorithm for nondifferentiable optimization ⋮ An algorithm for linearly constrained convex nondifferentiable minimization problems ⋮ Subgradient projection algorithm. II ⋮ A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems ⋮ The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review ⋮ Aggregate codifferential method for nonsmooth DC optimization ⋮ Large-scale unit commitment under uncertainty ⋮ Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results ⋮ New variable-metric algorithms for nondifferentiable optimization problems ⋮ Descent algorithm for a class of convex nondifferentiable functions ⋮ Nonmonotone bundle-type scheme for convex nonsmooth minimization ⋮ Convergence of some algorithms for convex minimization ⋮ A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations ⋮ Airline crew scheduling: state-of-the-art
This page was built for publication:
