Minimization of functions having Lipschitz continuous first partial derivatives
From MaRDI portal
Publication:2541105
DOI10.2140/pjm.1966.16.1zbMath0202.46105OpenAlexW1969811075WikidataQ61603143 ScholiaQ61603143MaRDI QIDQ2541105
Publication date: 1966
Published in: Pacific Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/pjm.1966.16.1
Related Items
Shape optimisation problem for stability of Navier–Stokes flow field, Research on three-step accelerated gradient algorithm in deep learning, An adaptive nonmonotone global Barzilai–Borwein gradient method for unconstrained optimization, Active Subspace of Neural Networks: Structural Analysis and Universal Attacks, Model-free Nonconvex Matrix Completion: Local Minima Analysis and Applications in Memory-efficient Kernel PCA, Hybridization rule applied on accelerated double step size optimization scheme, CONUNDrum: a program for orbital-free density functional theory calculations, Nesterov's Method for Convex Optimization, Unnamed Item, Global convergence of the gradient method for functions definable in o-minimal structures, Convex optimization-based structure-preserving filter for multidimensional finite element simulations, An Efficient and Robust Scalar Auxialiary Variable Based Algorithm for Discrete Gradient Systems Arising from Optimizations, A new nonmonotone spectral projected gradient algorithm for box-constrained optimization problems in \(m \times n\) real matrix space with application in image clustering, A comprehensive implicit substepping integration scheme for multisurface plasticity, A quasi-Newton trust-region method for optimization under uncertainty using stochastic simplex approximate gradients, Compositional Graphical Lasso Resolves the Impact of Parasitic Infection on Gut Microbial Interaction Networks in a Zebrafish Model, A large strain anisotropic ductile damage model -- effective driving forces and gradient-enhancement of damage vs. plasticity, A fast and simple modification of Newton's method avoiding saddle points, Optimization of unconstrained problems using a developed algorithm of spectral conjugate gradient method calculation, Numerical approach to solve imprecisely defined systems using inner outer direct search optimization technique, A Derivative-Free Nonlinear Least Squares Solver, SVRG meets AdaGrad: painless variance reduction, A three-term conjugate gradient algorithm with restart procedure to solve image restoration problems, Proximal variable metric method with spectral diagonal update for large scale sparse optimization, Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum, Time-delay Hammerstein system identification using modified cross-correlation method and variable stacking length multi-error algorithm, Regularized Newton Method with Global \({\boldsymbol{\mathcal{O}(1/{k}^2)}}\) Convergence, A Broyden-based algorithm for multi-objective local-search optimization, Alternating cyclic vector extrapolation technique for accelerating nonlinear optimization algorithms and fixed-point mapping applications, Iterative algorithms for a non-linear inverse problem in atmospheric lidar, nlTGCR: A Class of Nonlinear Acceleration Procedures Based on Conjugate Residuals, Swarm-based optimization with random descent, Synthesis of parameters of proportionally-integral and proportionally-integral-differential controllers for stationary linear objects with nonzero initial conditions, Newton-Anderson at Singular Points, Optimal learning, Two methods for the implicit integration of stiff reaction systems, Robust regression against heavy heterogeneous contamination, Efficient 1.5D full waveform inversion in the Laplace-Fourier domain, An adaptive Riemannian gradient method without function evaluations, Robust supervised learning with coordinate gradient descent, Minimizing oracle-structured composite functions, A Blind Source Separation Technique for Document Restoration, Random Coordinate Descent Methods for Nonseparable Composite Optimization, A non-linear conjugate gradient in dual space for \(L_p\)-norm regularized non-linear least squares with application in data assimilation, Time‐delay and parameter estimation for an ARX model based on copula theory and Armijo criterion and their applications in the modeling of the dynamics of the UAV, An overview of nonlinear optimization, Vortex breakdown, linear global instability and sensitivity of pipe bifurcation flows, Direct Estimation of the Derivative of Quadratic Mutual Information with Application in Supervised Dimension Reduction, Optimizing Frequencies in a Transit Network: a Nonlinear Bi‐level Programming Approach, Global convergece of the bfgs algorithm with nonmonotone linesearch∗∗this work is supported by national natural science foundation$ef:, Choice of a step-length in an almost everywhere differentiable (on every direction) (almost everywhere locally lipschitz) lower-semi-continuous minimization problem, Projected dynamical systems modeling and computation of spatial network equilibria, Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization, Extragradient methods for nonsmooth equilibrium problems in Banach spaces, A globally convergent BFGS method for pseudo-monotone variational inequality problems, Oblique projections, Broyden restricted class and limited-memory quasi-Newton methods, Application of scaled nonlinear conjugate-gradient algorithms to the inverse natural convection problem, An introduction to continuous optimization for imaging, Unnamed Item, A new nonmonotone line search technique for unconstrained optimization, Extragradient Methods for Vector Equilibrium Problems in Banach Spaces, Unnamed Item, Some new step-size rules for optimization problems, Modified Goldstein--Levitin--Polyak projection method for asymmetric strongly monotone variational inequalities, On the nonmonotone line search, On the convergence of sequential minimization algorithms, Accelerated gradient descent methods with line search, Linear and nonlinear sensor placement strategies for mean-flow reconstruction via data assimilation, Convergence of the descent Dai–Yuan conjugate gradient method for unconstrained optimization, Analysis of the gradient method with an Armijo–Wolfe line search on a class of non-smooth convex functions, Essentials of numerical nonsmooth optimization, A Stochastic Line Search Method with Expected Complexity Analysis, Optimal Coatings, Bang‐Bang Controls, And Gradient Techniques, Numerical methods for nonlinear equations, A Preconditioned Fast Finite Volume Method for Distributed-Order Diffusion Equation and Applications, Backtracking Strategies for Accelerated Descent Methods with Smooth Composite Objectives, Extended Newton Methods for Multiobjective Optimization: Majorizing Function Technique and Convergence Analysis, A spectral KRMI conjugate gradient method under the strong-Wolfe line search, Newton's Method for Monte Carlo--Based Residuals, MG/OPT and Multilevel Monte Carlo for Robust Optimization of PDEs, Parallel implementation of augmented Lagrangian method within L-shaped method for stochastic linear programs, On Matrix Nearness Problems: Distance to Delocalization, Comparison of Accuracy and Scalability of Gauss--Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition, Solving an inverse heat convection problem with an implicit forward operator by using a projected quasi-Newton method, Complex-Valued Imaging with Total Variation Regularization: An Application to Full-Waveform Inversion in Visco-acoustic Media, Essentials of numerical nonsmooth optimization, Optimal Control and Stabilization for Some Fisher-Like Models, The higher-order Levenberg–Marquardt method with Armijo type line search for nonlinear equations, Unnamed Item, A modified secant method for unconstrained minimization, A nonmonotone scaled conjugate gradient algorithm for large-scale unconstrained optimization, EXTRAGRADIENT METHODS FOR QUASI-EQUILIBRIUM PROBLEMS IN BANACH SPACES, Additive Schwarz methods for convex optimization with backtracking, Adjoint-based inversion for porosity in shallow reservoirs using pseudo-transient solvers for non-linear hydro-mechanical processes, A class of gap functions for variational inequalities, An inverse eikonal method for identifying ventricular activation sequences from epicardial activation maps, A matrix sampling approach for efficient SimRank computation, Reconstruction of the residual stresses in a hyperelastic body using ultrasound techniques, Convergence of line search methods for unconstrained optimization, Implicit algorithms for eigenvector nonlinearities, Reduced Jacobian method, Scalable proximal methods for cause-specific hazard modeling with time-varying coefficients, On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds, 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, Descent methods with linesearch in the presence of perturbations, Iterative processes: A survey of convergence theory using Lyapunov second method, \(l_1\) regularized multiplicative iterative path algorithm for non-negative generalized linear models, Optimal control methodology for the counter-terrorism strategies: the relaxation based approach, Inexact hierarchical scale separation: a two-scale approach for linear systems from discontinuous Galerkin discretizations, The computational asymptotics of Gaussian variational inference and the Laplace approximation, Smoothly approximated support vector domain description, A dimension-reducing method for unconstrained optimization, A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem, Convergence analysis of the extragradient method for equilibrium problems in Hadamard spaces, OPTAC: A portable software package for analyzing and comparing optimization methods by visualization, Generalisations, examples, and counter-examples in analysis and optimisation. \textit{In honour of Michel Théra at 70}, Descentwise inexact proximal algorithms for smooth optimization, On the nonmonotonicity degree of nonmonotone line searches, Finding zeros of nonlinear functions using the hybrid parallel cell mapping method, Smoothed \(\ell_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, Global convergence of algorithms with nonmonotone line search strategy in unconstrained optimization, Half-quadratic image restoration with a non-parallelism constraint, A fast approach to optimal transport: the back-and-forth method, A finite volume/discontinuous Galerkin method for the advective Cahn-Hilliard equation with degenerate mobility on porous domains stemming from micro-CT imaging, Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case, Accelerated double direction method for solving unconstrained optimization problems, Adjustment of O-D trip matrices from observed volumes: an algorithmic approach based on conjugate directions., A survey of gradient methods for solving nonlinear optimization, The hybrid BFGS-CG method in solving unconstrained optimization problems, A QSC method for fractional subdiffusion equations with fractional boundary conditions and its application in parameters identification, Optimal cavity shape design for acoustic liners using Helmholtz equation with visco-thermal losses, A class of gradient unconstrained minimization algorithms with adaptive stepsize, An adaptive Gauss-Newton algorithm for training multilayer nonlinear filters that have embedded memory, An algebraic flux correction scheme facilitating the use of Newton-like solution strategies, 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, Backtracking gradient descent method and some applications in large scale optimisation. II: Algorithms and experiments, An inexact Newton method for solving complementarity problems in hydrodynamic lubrication, A doubly relaxed minimal-norm Gauss-Newton method for underdetermined nonlinear least-squares problems, Comparison of nonlinear solvers within continuation method for steady-state variably saturated groundwater flow modelling, Hybridization of accelerated gradient descent method, Parallel two-phase methods for global optimization on GPU, Measures minimizing regularized dispersion, Levenberg-Marquardt method for solving systems of absolute value equations, Accumulative approach in multistep diagonal gradient-type method for large-scale unconstrained optimization, Line search methods with guaranteed asymptotical convergence to an improving local optimum of multimodal functions, Low-rank and sparse matrices fitting algorithm for low-rank representation, A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem, A generalized Newton algorithm for quantile regression models, 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, Modelling control of crystal growth processes, Topology optimization of hyperelastic structures with anisotropic fiber reinforcement under large deformations, A flow perspective on nonlinear least-squares problems, Natural gradient for combined loss using wavelets, A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models, On efficiency of nonmonotone Armijo-type line searches, Nonoptimal termination properties of quadratic interpolation univariate searches, Comparing gradient descent with automatic differentiation and particle swarm optimization techniques for estimating tumor blood flow parameters in contrast-enhanced imaging, In favor of conjugate directions: a generalized acceptable-point algorithm for function minimization, Dynamic search trajectory methods for global optimization, Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization, A hybrid self-adaptive conjugate first order reliability method for robust structural reliability analysis, A class of methods for unconstrained minimization based on stable numerical integration techniques, A Newton-type curvilinear search method for constrained optimization, A global hybrid derivative-free method for high-dimensional systems of nonlinear equations, Stochastic algorithms with Armijo stepsizes for minimization of functions, A globalization procedure for solving nonlinear systems of equations, Statistical and deterministic inverse methods in the geosciences: introduction, review, and application to the nonlinear diffusion equation, On solving three classes of nonlinear programming problems via simple differentiable penalty functions, Stochastic approximation algorithm for minimax problems, A \(q\)-Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization problems, Pseudorandom lattices for global optimization, Experiments with new stochastic global optimization search techniques, Convergence of implementable descent algorithms for unconstrained optimization, A modified homogeneous algorithm for function minimization, Solution of the static contact problem with Coulomb friction between an elastic body and a rigid foundation, Direct search methods: Then and now, Extragradient method with Bregman distances for solving vector quasi-equilibrium problems, Optimal low-order controller design via `LQG-like' parametrization, On identifying Dirichlet condition for under-determined problem of the Laplace equation by BEM, 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, Conjugate gradient methods with Armijo-type line searches., Convergence of quasi-Newton method with new inexact line search, High-order relaxation approaches for adjoint-based optimal control problems governed by nonlinear hyperbolic systems of conservation laws, Projection-based iterative mode scheduling for switched systems, Location problems with costs being sums of powers of Euclidean distances, A stochastic steepest-descent algorithm, A generalized conditional gradient method and its connection to an iterative shrinkage method, A truncated Newton method with non-monotone line search for unconstrained optimization, New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems, A stochastic algorithm using one sample point per iteration and diminishing step-sizes, Properties of the sequential gradient-restoration algorithm (SGRA). II: Convergence analysis, Computation and application of the paired combinatorial logit stochastic user equilibrium problem, A steady-state solver and stability calculator for nonlinear internal wave flows, Sequential quadratic programming (SQP) for optimal control in direct numerical simulation of turbulent flow, Adaptive change of basis in entropy-based moment closures for linear kinetic equations, An efficient method for optimal correcting of absolute value equations by minimal changes in the right hand side, Convergence of the Polak-Ribiére-Polyak conjugate gradient method, A hybrid approach of bundle and Benders applied large mixed linear integer problem, Global convergence properties of two modified BFGS-type methods, New conjugacy condition and related new conjugate gradient methods for unconstrained optimization, The convergence of conjugate gradient method with nonmonotone line search, Shape optimization of continua using NURBS as basis functions, Shape optimization for a link mechanism, Convergence of Liu-Storey conjugate gradient method, Convergence and stability of line search methods for unconstrained optimization, A new class of nonlinear conjugate gradient coefficients with global convergence properties, Stepsize analysis for descent methods, Computer implementations of iterative and non-iterative crystal plasticity solvers on high performance graphics hardware, Some Goldstein's type methods for co-coercive variant variational inequalities, A generalized direct search acceptable-point technique for use with descent-type multivariate algorithms, On numerical methods for nonlinear singularly perturbed Schrödinger problems, Inverse variational inequalities with projection-based solution methods, Nonmonotone adaptive trust region method, An efficient descent direction method with cutting planes, Switching mode generation and optimal estimation with application to skid-steering, An accelerated double step size model in unconstrained optimization, The Weber problem revisited, An algorithm for linearly constrained nonlinear programming problems, Local convergence of an adaptive scalar method and its application in a nonoverlapping domain decomposition scheme, Two modifications of the method of the multiplicative parameters in descent gradient methods, Constrained optimization along geodesics, An algorithm for solving linearly constrained minimax problems, A least-distance programming procedure for minimization problems under linear constraints, Scalar correction method for solving large scale unconstrained minimization problems, Global optimization using a synchronization of multiple search points autonomously driven by a chaotic dynamic model, Newton's method for the common eigenvector problem, Turning restriction design in traffic networks with a budget constraint, Some techniques for solving absolute value equations, A new class of nonlinear conjugate gradient coefficients with exact and inexact line searches, Partitioned quasi-Newton methods for nonlinear equality constrained optimization, Mesh independence of Newton-like methods for infinite dimensional problems, A greedy feature selection algorithm for big data of high dimensionality, Augmented Lagrangian method within L-shaped method for stochastic linear programs, An adjoint-based method for a linear mechanically-coupled tumor model: application to estimate the spatial variation of murine glioma growth based on diffusion weighted magnetic resonance imaging, A barrier function method for minimax problems, Optimizing fiber orientation in fiber-reinforced materials using efficient upscaling, Convergence of PRP method with new nonmonotone line search, Non-linear Tikhonov regularization in Banach spaces for inverse scattering from anisotropic penetrable media, A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule, A new conic method for unconstrained minimization, A bilateral-truncated-loss based robust support vector machine for classification problems, Multi-modal control using adaptive motion description languages, Efficient, accurate and flexible finite element solvers for chemotaxis problems, A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization, Optimal mode-switching for hybrid systems with varying initial states, Modified nonmonotone Armijo line search for descent method, A Newton collocation method for solving dynamic bargaining games, A robust implementation of a sequential quadratic programming algorithm with successive error restoration, Korpelevich's method for variational inequality problems in Banach spaces, A globally convergent algorithm for the Euclidean multiplicity location problem, A Newton method for linear programming, 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, A curvilinear method based on minimal-memory BFGS updates, Mesh shape-quality optimization using the inverse mean-ratio metric, Approximation methods for the unconstrained optimization, The method of successive orthogonal projections for solving nonlinear simultaneous equations, An accelerated conjugate direction method to solve linearly constrained minimization problems, A comparison of feasible direction methods for the stochastic transportation problem, Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization, Feasible directions in economic policy, Numerically stable computation of step-sizes for descent methods. The nonconvex case, Computing laser beam paths in optical cavities: an approach based on geometric Newton method, Conditional gradient algorithms with open loop step size rules, The effect of data grid size on certain interpolation methods for unconstrained function minimization, Policy gradient in Lipschitz Markov decision processes, A Kalman-tracking filter approach to nonlinear programming, A cut-peak function method for global optimization, A modified PRP conjugate gradient method, A new three-term 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, The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis, Convergent stepsizes for constrained optimization algorithms, On the convergence of curvilinear search algorithms in unconstrained optimization, An \(\epsilon\)-active barrier-function method for solving minimax problems, Convergence of descent method with new line search, Variable metric random pursuit, Stopping criteria for linesearch methods without derivatives, Computing minimum norm solution of linear systems of equations by the generalized Newton method, A pathsearch damped Newton method for computing general equilibria, STUDYING THE BASIN OF CONVERGENCE OF METHODS FOR COMPUTING PERIODIC ORBITS, Unnamed Item, Reconstruction of unsteady viscous flows using data assimilation schemes, A class of nonmonotone Armijo-type line search method for unconstrained optimization, Comparing change-point location in independent series, A coupled complex boundary expanding compacts method for inverse source problems, Self-adaptive projection method for co-coercive variational inequalities, A new version of the Liu-Storey conjugate gradient method, Semismooth Newton method for frictional contact between pseudo-rigid bodies, Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization, The convergence of subspace trust region methods, On the convergence rate of scaled gradient projection method, Forcing strong convergence of Korpelevich's method in Banach spaces with its applications in game theory, A recalling-enhanced recurrent neural network: conjugate gradient learning algorithm and its convergence analysis, A first-order numerical approach to switched-mode systems optimization, Stochastic quasi-Newton with line-search regularisation, Robust and efficient fixed-point algorithm for the inverse elastostatic problem to identify myocardial passive material parameters and the unloaded reference configuration, Multiscale control of Stackelberg games, Fast gradient methods for uniformly convex and weakly smooth problems, First-order continuation method for steady-state variably saturated groundwater flow modeling, Endpoint Geodesics on the Stiefel Manifold Embedded in Euclidean Space, Constrained pseudo-transient continuation, Optimal sensor placement for variational data assimilation of unsteady flows past a rotationally oscillating cylinder, Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates, Definition and updating of simplified models of joint stiffness, Chunking for massive nonlinear kernel classification, Discriminative Bayesian filtering lends momentum to the stochastic Newton method for minimizing log-convex functions, A new approach to overcome the overflow problem in computer-aided analysis of nonlinear resistive circuits, Variance-Based Extragradient Methods with Line Search for Stochastic Variational Inequalities, Computing equilibria on large multicommodity networks: An application of truncated quadratic programming algorithms, An inexact line search approach using modified nonmonotone strategy for unconstrained optimization, Mise à jour de la métrique dans les méthodes de quasi-Newton réduites en optimisation avec contraintes d'égalité, Global convergence of a modified BFGS-type method for unconstrained non-convex minimization, Newton-type Methods with Generalized Distances For Constrained Optimization, The incorporation of the semi-implicit linear equations into Newton's method to solve radiation transfer equations, Numerical Applications for Insulin Treatment Models, Gaussian mixture modeling and learning of neighboring characters for multilingual text extraction in images, A superlinearly convergent algorithm for minimization without evaluating derivatives, Iterative solvers within sequences of large linear systems in non-linear structural mechanics, A variant of korpelevich’s method for variational inequalities with a new search strategy, A dual scheme for traffic assignment problems, Unnamed Item, On the acceleration of the backpropagation training method, Gradient descent approach to optimal mode scheduling in hybrid dynamical systems, Nonconvex optimization using negative curvature within a modified linesearch, Comparison of optimization algorithms, On step-size estimation of line search methods, A finite newton method for classification, Convergence of nonmonotone line search method, Readily implementable conjugate gradient methods, A modification of Armijo's step-size rule for negative curvature, An optimal control approach to mode generation in hybrid systems, The non-monotone conic algorithm, ADAPTIVE ALGORITHMS FOR NEURAL NETWORK SUPERVISED LEARNING: A DETERMINISTIC OPTIMIZATION APPROACH, Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems, Curvilinear path steplength algorithms for minimization which use directions of negative curvature, An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion, An algorithm for nonlinear multicommodity flow problems, Optimal timing control of switched linear systems based on partial information, Internal null stabilization for some diffusive models of population dynamics, An alternating direction approximate Newton algorithm for ill-conditioned inverse problems with application to parallel MRI, On Weak and Strong Convergence of the Projected Gradient Method for Convex Optimization in Real Hilbert Spaces, Global convergence of conjugate gradient method, Zur Konvergenzrate von Verfahren mit konjugierten Gradienten ohne exakte Strahlminimierung, Unnamed Item, A new family of conjugate gradient methods, On the use of directions of negative curvature in a modified newton method, Optimization of Multi-agent Motion Programs with Applications to Robotic Marionettes, Flexible complementarity solvers for large-scale applications, A unified convergence framework for nonmonotone inexact decomposition methods, Secant update version of quasi-Newton PSB with weighted multisecant equations, An extragradient method for vector equilibrium problems on Hadamard manifolds, Computer Algebra and Line Search, A Homotopy based approach to unconstrained optimization, A method for computing all the zeros of a polynomial with real coefficients, A numerical procedure enabling accurate descriptions of strain rate-sensitive flow of polycrystals within crystal visco-plasticity theory, Variational inequality approach to enforcing the non-negative constraint for advection-diffusion equations, Convergence of conjugate gradient methods with constant stepsizes, Optimization approach for the Monge-Ampère equation, On the convergence of the forward–backward splitting method with linesearches, Optimal fixed-levels control for nonlinear systems with quadratic cost-functionals, A FAST conic method for function minimization, A Multilevel Framework for Sparse Optimization with Application to Inverse Covariance Estimation and Logistic Regression, A nonmonotone line search method and its convergence for unconstrained optimization, Probabilistic Line Searches for Stochastic Optimization, Global convergence for Newton methods in mathematical programming, A method of feasible directions using function approximations, with applications to min max problems, A generalized proximal point algorithm for certain non-convex minimization problems, Algorithms for quasiconvex minimization, Stable Lévy diffusion and related model fitting, Convergence of the steepest descent method for minimizing quasiconvex functions, Linearly constrained pseudo-Newton method, An interior point method for \(L_{1 / 2}\)-SVM and application to feature selection in classification, Likelihood estimation for generalized mixed exponential distributions, On the tritronquée solutions of \(\mathrm{P}_{\mathrm{I}}^2\), A Class of Accelerated Conjugate Direction Methods for Linearly Constrained Minimization Problems, Technology of multilinear programming in naturally conditioned models. II
