scientific article; zbMATH DE number 3894826

Publication date: 1985

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

subgradient method applications locally Lipschitz functions nonsmooth functions nonlinear minimax problems space dilatation methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Methods of successive quadratic programming type (90C55)

Related Items (only showing first 100 items - show all)

An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem ⋮ Nonmonotone stabilization methods for nonlinear equations ⋮ On using approximations of the Benders master problem ⋮ The symmetric rank-one quasi-Newton method is a space-dilation subgradient algorithm ⋮ Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization ⋮ Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs ⋮ Optimal placement of irradiation sources in the planning of radiotherapy: mathematical models and methods of solving ⋮ An ODE-based trust region method for unconstrained optimization problems ⋮ A dual method for minimizing a nonsmooth objective over one smooth inequality constraint ⋮ Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies ⋮ Convergence and computational analyses for some variable target value and subgradient deflection methods ⋮ On numerical solving the spherical separability problem ⋮ A Lagrangian heuristic for sprint planning in agile software development ⋮ Applications of gauge duality in robust principal component analysis and semidefinite programming ⋮ An algorithm for nondifferentiable optimization ⋮ Wave simulation in 2D heterogeneous transversely isotropic porous media with fractional attenuation: a Cartesian grid approach ⋮ Subgradient method for nonconvex nonsmooth optimization ⋮ A bundle modification strategy for convex minimization ⋮ A hybrid approach of bundle and Benders applied large mixed linear integer problem ⋮ Subgradient projection algorithms and approximate solutions of convex feasibility problems ⋮ Approximating Clarke's subgradients of semismooth functions by divided differences ⋮ Spectral projected subgradient with a momentum term for the Lagrangean dual approach ⋮ PyOpt: a python-based object-oriented framework for nonlinear constrained optimization ⋮ A subgradient method for multiobjective optimization on Riemannian manifolds ⋮ Sparse nonnegative matrix underapproximation and its application to hyperspectral image analysis ⋮ The CoMirror algorithm for solving nonsmooth constrained convex problems ⋮ iPiasco: inertial proximal algorithm for strongly convex optimization ⋮ Gradient-only approaches to avoid spurious local minima in unconstrained optimization ⋮ First-order methods of smooth convex optimization with inexact oracle ⋮ Subgradient methods for huge-scale optimization problems ⋮ Approximate level method for nonsmooth convex minimization ⋮ Subgradient method for convex feasibility on Riemannian manifolds ⋮ Determining six cardiac conductivities from realistically large datasets ⋮ A system of nonsmooth equations solver based upon subgradient method ⋮ The minimum spanning tree problem with conflict constraints and its variations ⋮ A partially inexact bundle method for convex semi-infinite minmax problems ⋮ Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions ⋮ Proximity control in bundle methods for convex nondifferentiable minimization ⋮ Multi-level production scheduling for a class of flexible machining and assembly systems ⋮ A characterization of optimal scaling for structured singular value computation ⋮ An infeasible-point subgradient method using adaptive approximate projections ⋮ Dual quadratic estimates in polynomial and Boolean programming ⋮ Variable target value subgradient method ⋮ Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality ⋮ Least quantile regression via modern optimization ⋮ A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem ⋮ A method for approximating the solution set of a system of convex inequalities by polytopes ⋮ Diagonal bundle method for nonsmooth sparse optimization ⋮ An exact algorithm for cost minimization in series reliability systems with multiple component choices ⋮ Dynamic smoothness parameter for fast gradient methods ⋮ Projection algorithms for linear programming ⋮ Differentiable McCormick relaxations ⋮ A spline smoothing Newton method for finite minimax problems ⋮ A smooth method for the finite minimax problem ⋮ Dual estimates in multiextremal problems ⋮ An adaptive competitive penalty method for nonsmooth constrained optimization ⋮ Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems ⋮ Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs ⋮ Using underapproximations for sparse nonnegative matrix factorization ⋮ New filled functions for nonsmooth global optimization ⋮ Nondifferentiable optimization via smooth approximation: General analytical approach ⋮ A one-parameter filled function for nonsmooth global optimization and its application ⋮ Dynamic system methods for solving mixed linear matrix inequalities and linear vector inequalities and equalities ⋮ On embedding the volume algorithm in a variable target value method. ⋮ Benefit sharing in holding situations ⋮ A truncated aggregate smoothing Newton method for minimax problems ⋮ Tetrolet shrinkage with anisotropic total variation minimization for image approximation ⋮ Two-direction subgradient method for non-differentiable optimization problems ⋮ Primal-dual subgradient methods for convex problems ⋮ Dual subgradient method with averaging for optimal resource allocation ⋮ Semi-explicit solution and fast minimization scheme for an energy with \(\ell _{1}\)-fitting and Tikhonov-like regularization ⋮ An optimal algorithm for global optimization and adaptive covering ⋮ Smooth minimization of non-smooth functions ⋮ Convergent Lagrangian and domain cut method for nonlinear knapsack problems ⋮ Subgradient projection algorithms for convex feasibility problems in the presence of computational errors ⋮ Single-input--single-output \({\mathcal H}_ \infty\)-control with time domain constraints ⋮ Generalized gradient learning on time series ⋮ Two ``well-known properties of subgradient optimization ⋮ Subgradient algorithm on Riemannian manifolds ⋮ Conditional subgradient optimization -- theory and applications ⋮ Hamilton-Jacobi-Bellman formalism for optimal climate control of greenhouse crop ⋮ Convergence of a generalized subgradient method for nondifferentiable convex optimization ⋮ A branch and bound-outer approximation algorithm for concave minimization over a convex set ⋮ Enumeration approach for linear complementarity problems based on a reformulation-linearization technique ⋮ Main directions in the development of informatics ⋮ Subgradient methods for saddle-point problems ⋮ Convergence rates of subgradient methods for quasi-convex optimization problems ⋮ Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints ⋮ Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming ⋮ Inexact subgradient methods with applications in stochastic programming ⋮ An improved subgradient method for constrained nondifferentiable optimization ⋮ On the rate of convergence of two minimax algorithms ⋮ New variable-metric algorithms for nondifferentiable optimization problems ⋮ Nonmonotone bundle-type scheme for convex nonsmooth minimization ⋮ Partial linearization methods in nonlinear programming ⋮ A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations ⋮ Primal recovery from consensus-based dual decomposition for distributed convex optimization ⋮ Global minimization by reducing the duality gap ⋮ A decomposition method for large scale MILPs, with performance guarantees and a power system application ⋮ Airline crew scheduling: state-of-the-art

This page was built for publication: