Minimization of functions having Lipschitz continuous first partial derivatives
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A cut-peak function method for global optimization
- A modified PRP conjugate gradient method
- Acceleration of conjugate gradient algorithms for unconstrained optimization
- A new trust region method with adaptive radius
- Stochastic design optimization: application to reacting flows
- Convergent stepsizes for constrained optimization algorithms
- On the convergence of curvilinear search algorithms in unconstrained optimization
- Location problems with costs being sums of powers of Euclidean distances
- A stochastic steepest-descent algorithm
- A truncated Newton method with non-monotone line search for unconstrained optimization
- A stochastic algorithm using one sample point per iteration and diminishing step-sizes
- Properties of the sequential gradient-restoration algorithm (SGRA). II: Convergence analysis
- Stepsize analysis for descent methods
- A generalized direct search acceptable-point technique for use with descent-type multivariate algorithms
- The Weber problem revisited
- An algorithm for linearly constrained nonlinear programming problems
- Constrained optimization along geodesics
- An algorithm for solving linearly constrained minimax problems
- A least-distance programming procedure for minimization problems under linear constraints
- Partitioned quasi-Newton methods for nonlinear equality constrained optimization
- Mesh independence of Newton-like methods for infinite dimensional problems
- A barrier function method for minimax problems
- A new conic method for unconstrained minimization
- A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
- A globally convergent algorithm for the Euclidean multiplicity location problem
- Accelerating procedures for methods of conjugate directions
- On the rate of convergence of some feasible direction algorithms
- On the Pironneau-Polak method of centers
- Convexity, monotonicity, and gradient processes in Hilbert space
- Approximation methods for the unconstrained optimization
- An accelerated conjugate direction method to solve linearly constrained minimization problems
- Feasible directions in economic policy
- Numerically stable computation of step-sizes for descent methods. The nonconvex case
- Conditional gradient algorithms with open loop step size rules
- The effect of data grid size on certain interpolation methods for unconstrained function minimization
- Nonoptimal termination properties of quadratic interpolation univariate searches
- In favor of conjugate directions: a generalized acceptable-point algorithm for function minimization
- A class of methods for unconstrained minimization based on stable numerical integration techniques
- A Newton-type curvilinear search method for constrained optimization
- Stochastic algorithms with Armijo stepsizes for minimization of functions
- Optimal low-order controller design via `LQG-like' parametrization
- On the rate of convergence of two minimax algorithms
- Partial linearization methods in nonlinear programming
- Optimization algorithm with probabilistic estimation
- Analysis and implementation of a dual algorithm for constrained optimization
- On the use of consistent approximations in the solution of semi-infinite optimization and optimal control problems
- An adaptive conjugate gradient learning algorithm for efficient training of neural networks
- A globally convergent algorithm for facility location on a sphere
- A class of gap functions for variational inequalities
- On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
- Descent methods with linesearch in the presence of perturbations
- Global convergence of algorithms with nonmonotone line search strategy in unconstrained optimization
- Adjustment of O-D trip matrices from observed volumes: an algorithmic approach based on conjugate directions.
- Experiments with new stochastic global optimization search techniques
- Convergence of implementable descent algorithms for unconstrained optimization
- Direct search methods: Then and now
- On identifying Dirichlet condition for under-determined problem of the Laplace equation by BEM
- Conjugate gradient methods with Armijo-type line searches.
- Reconstruction of the residual stresses in a hyperelastic body using ultrasound techniques
- Reduced Jacobian method
- \(l_1\) regularized multiplicative iterative path algorithm for non-negative generalized linear models
- Inexact hierarchical scale separation: a two-scale approach for linear systems from discontinuous Galerkin discretizations
- Smoothly approximated support vector domain description
- Generalisations, examples, and counter-examples in analysis and optimisation. \textit{In honour of Michel Théra at 70}
- On the nonmonotonicity degree of nonmonotone line searches
- Smoothed _1-regularization-based line search for sparse signal recovery
- POD/DEIM reduced-order modeling of time-fractional partial differential equations with applications in parameter identification
- Half-quadratic image restoration with a non-parallelism constraint
- A finite volume/discontinuous Galerkin method for the advective Cahn-Hilliard equation with degenerate mobility on porous domains stemming from micro-CT imaging
- Accelerated double direction method for solving unconstrained optimization problems
- The hybrid BFGS-CG method in solving unconstrained optimization problems
- Convergence rate of descent method with new inexact line-search on Riemannian manifolds
- An adjoint based pressure boundary optimal control approach for fluid-structure interaction problems
- An inexact Newton method for solving complementarity problems in hydrodynamic lubrication
- Accumulative approach in multistep diagonal gradient-type method for large-scale unconstrained optimization
- A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
- Modelling control of crystal growth processes
- A globalization procedure for solving nonlinear systems of equations
- On solving three classes of nonlinear programming problems via simple differentiable penalty functions
- Stochastic approximation algorithm for minimax problems
- Pseudorandom lattices for global optimization
- A modified homogeneous algorithm for function minimization
- Convergence of line search methods for unconstrained optimization
- Efficent line search algorithm for unconstrained optimization
- An extension of the partial credit model with an application to the measurement of change
- Probability-theoretical generalization of the second Lyapunov method
- Iterative processes: A survey of convergence theory using Lyapunov second method
- A dimension-reducing method for unconstrained optimization
- OPTAC: A portable software package for analyzing and comparing optimization methods by visualization
- Descentwise inexact proximal algorithms for smooth optimization
- A class of gradient unconstrained minimization algorithms with adaptive stepsize
- An adaptive Gauss-Newton algorithm for training multilayer nonlinear filters that have embedded memory
- Hybridization of accelerated gradient descent method
- Parallel two-phase methods for global optimization on GPU
- Measures minimizing regularized dispersion
- Low-rank and sparse matrices fitting algorithm for low-rank representation
- Modified inexact Levenberg-Marquardt methods for solving nonlinear least squares problems
- Numerical investigation of a fully coupled micro-macro model for mineral dissolution and precipitation
- Topology optimization of hyperelastic structures with anisotropic fiber reinforcement under large deformations
- A flow perspective on nonlinear least-squares problems
This page was built for publication: Minimization of functions having Lipschitz continuous first partial derivatives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2541105)
