scientific article; zbMATH DE number 3577030
From MaRDI portal
Publication:4146571
zbMATH Open0369.90093MaRDI QIDQ4146571FDOQ4146571
Authors: Philip Wolfe 
Publication date: 1975
Title of this publication is not available (Why is that?)
Cited In (only showing first 100 items - show all)
- An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems
- A generalized iterative scheme for network design problem
- On the Fermat—Weber problem with convex cost functions
- A proximal trust-region algorithm for column generation stabilization
- Nonsmooth optimization via quasi-Newton methods
- The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
- Minimizing Piecewise-Concave Functions Over Polyhedra
- The omnipresence of Lagrange
- Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs
- Benefit sharing in holding situations
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
- A minimization method for the sum of a convex function and a continuously differentiable function
- Note on a method of conjugate subgradients for minimizing nondifferentiable functions
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- Convergence of some algorithms for convex minimization
- Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
- Penalty-proximal methods in convex programming
- Extension of some results for channel capacity using a generalized information measure
- On Lipschitz optimization based on gray-box piecewise linearization
- Optimization for signal setting problems using non-smooth techniques
- A derivative-free approximate gradient sampling algorithm for finite minimax problems
- A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization
- A partially inexact bundle method for convex semi-infinite minmax problems
- New variants of bundle methods
- Level-set methods for convex optimization
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
- An effective nonsmooth optimization algorithm for locally Lipschitz functions
- An algorithm for linearly constrained convex nondifferentiable minimization problems
- An optimization model for area traffic control with link tolls
- Variable metric methods for minimizing a class of nondifferentiable functions
- A Newton's method for perturbed second-order cone programs
- Synthesis of cutting and separating planes in a nonsmooth optimization method
- A fast space-decomposition scheme for nonconvex eigenvalue optimization
- Sublinear upper bounds for stochastic programs with recourse
- Simultaneously optimizing link tolls and signal settings in a road network
- Large-scale unit commitment under uncertainty
- A non-smooth model for signalized road network design problems
- An efficient search algorithm for road network optimization
- A quasi-second-order proximal bundle algorithm
- Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization
- Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder)
- Optimization of congestion pricing road network with variable demands
- An approximate quasi-Newton bundle-type method for nonsmooth optimization
- A combined relaxation method for variational inequalities with nonlinear constraints
- A bundle type approach to the unconstrained minimization of convex nonsmooth functions
- An optimal variant of Kelley's cutting-plane method
- On convergence rates of subgradient optimization methods
- An algorithm for minimizing a class of locally Lipschitz functions
- Piecewise linear approximations in nonconvex nonsmooth optimization
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
- Airline crew scheduling: state-of-the-art
- A descent algorithm for nonsmooth convex optimization
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- Theorems of the alternative and duality
- A hybrid approach of bundle and Benders applied large mixed linear integer problem
- A regularized decomposition method for minimizing a sum of polyhedral functions
- Bundle method for non-convex minimization with inexact subgradients and function values
- New algorithmic alternatives for the O--D matrix adjustment problem on traffic networks
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
- Nonmonotone bundle-type scheme for convex nonsmooth minimization
- On some difficult linear programs coming from set partitioning
- Optimization of upper semidifferentiable functions
- A smooth method for the finite minimax problem
- Subgradient projection algorithm. II
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
- A descent method with linear programming subproblems for nondifferentiable convex optimization
- Near-optimal solutions to large-scale facility location problems
- Efficiency of proximal bundle methods
- Optimization of limited network capacity with toll settings
- An implementable algorithm for the optimal design centering, tolerancing, and tuning problem
- A subgradient projection algorithm
- New variable-metric algorithms for nondifferentiable optimization problems
- Optimization of lipschitz continuous functions
- On the method of shortest residuals for unconstrained optimization
- An adaptive competitive penalty method for nonsmooth constrained optimization
- A subgradient algorithm for certain minimax and minisum problems
- Extensions of subgradient projection algorithms
- A subgradient selection method for minimizing convex functions subject to linear constraints
- Analysis of the gradient method with an Armijo-Wolfe line search on a class of non-smooth convex functions
- Continuous outer subdifferentials in nonsmooth optimization
- Improving feasible directions for a class of nondifferentiable functions
- The method of successive affine reduction for nonlinear minimization
- Large-scale unit commitment under uncertainty: an updated literature survey
- A conceptual conjugate epi-projection algorithm of convex optimization: superlinear, quadratic and finite convergence
- Optimal Convergence Rates for the Proximal Bundle Method
- The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review
- Properties of functions satisfying a local Lipschitz condition
- Optimal scheduling of reservoir releases during flood: Deterministic optimization problem. I: Procedure
- A hybrid conjugate gradient algorithm for nonconvex functions and its applications in image restoration problems
- Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems
- A level-set method for convex optimization with a feasible solution path
- Numerical infinitesimals in a variable metric method for convex nonsmooth optimization
- Proximal Gradient Methods for Machine Learning and Imaging
- Title not available (Why is that?)
- \(\epsilon\)-subgradient projection algorithm
- Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4146571)
