scientific article; zbMATH DE number 3293978
From MaRDI portal
Publication:5576518
Cited in
(only showing first 100 items - show all)- On the linear convergence rates of exchange and continuous methods for total variation minimization
- Cocoercivity, smoothness and bias in variance-reduced stochastic gradient methods
- The gradient projection method with Armijo's step size on manifolds
- Complexity of linear minimization and projection on some sets
- A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix
- One approach to constructing cutting algorithms with dropping of cutting planes
- Generalized sufficiency criteria in continuous-time programming with application to a class of variational-type inequalities
- There is no variational characterization of the cycles in the method of periodic projections
- On the finite termination of the gradient projection method
- Gradient projection method on matrix manifolds
- Weak and strong convergence Bregman extragradient schemes for solving pseudo-monotone and non-Lipschitz variational inequalities
- On the inexact scaled gradient projection method
- On the Frank-Wolfe algorithm for non-compact constrained optimization problems
- Duality gap estimates for a class of greedy optimization algorithms in Banach spaces
- The gradient projection algorithm for a proximally smooth set and a function with Lipschitz continuous gradient
- Effective method for constrained minimum - reverse bridge theorem
- Cutting plane algorithms and state space constrained linear optimal control problems
- Extension of Newton's method to nonlinear functions with values in a cone
- Duality gap estimates for weak Chebyshev greedy algorithms in Banach spaces
- A linear separability criterion for sets of Euclidean space
- Alternating forward-backward splitting for linearly constrained optimization problems
- Scalable semidefinite programming
- An outer approximations algorithm for computer-aided design problems
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- A regularization parameter selection model for total variation based image noise removal
- An improved subgradient extragradient self-adaptive algorithm based on the golden ratio technique for variational inequality problems in Banach spaces
- Optimization of a Multiphysics Problem in Semiconductor Laser Design
- Existence of solution in thickness optimization problem for a plate
- Approximation of zeros of inverse strongly monotone operators in Banach spaces
- Algorithm model for penalty functions-type iterative pcedures
- Some applications of mathematical programming to problems in mathematical physics
- Frank-Wolfe and friends: a journey into projection-free first-order optimization methods
- On the convexity of integrals of multivalued mappings. Applications in control theory
- Nonwastefulness of interior iterative procedures
- Hybrid methods for network equilibrium problems
- Convergence analysis of two-step inertial Douglas-Rachford algorithm and application
- Globally solving the trust region subproblem using simple first-order methods
- Strong convexity of sets and functions
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
- Nonlinear programming methods in the presence of noise
- Applications of fixed-point and optimization methods to the multiple-set split feasibility problem
- Estimate of the modulus of continuity of the operator grad F
- Optimization of stochastic jump diffusion systems nonlinear in the control
- Primal and dual predicted decrease approximation methods
- Forward-backward-forward algorithms involving two inertial terms for monotone inclusions
- On properties of supporting and quasi-supporting vectors
- An optimal-storage approach to semidefinite programming using approximate complementarity
- Restarting Frank-Wolfe: faster rates under Hölderian error bounds
- Über eine Penalty-Methode
- Essentials of numerical nonsmooth optimization
- On finite convergence of iterative methods for variational inequalities in Hilbert spaces
- Strong convergence of modified algorithms based on the regularization for the constrained convex minimization problem
- Mann type iterative methods for finding a common solution of split feasibility and fixed point problems
- An efficient PGM-based algorithm with backtracking strategy for solving quadratic optimization problems with spherical constraint
- Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size
- A projected Newton method for minimization problems with nonlinear inequality constraints
- A unified description of iterative algorithms for traffic equilibria
- On solving of constrained convex minimize problem using gradient projection method
- Prediction-correction method with BB step sizes
- Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs
- A method of bi-coordinate variations with tolerances and its convergence
- A limited memory quasi-Newton trust-region method for box constrained optimization
- Sufficiency criteria and duality for nonlinear programs involving n-set functions
- Identification of contact pressures between deformable bodies by combining Finite elements and a novel hybrid minimization strategy
- An active set algorithm for nonlinear optimization with polyhedral constraints
- Averaged mappings and the gradient-projection algorithm
- Decomposition algorithm for convex differentiable minimization
- A new approximation of the matrix rank function and its application to matrix rank minimization
- Monotonicity of metric projection onto positive cones of ordered Euclidean spaces
- An elementary approach to tight worst case complexity analysis of gradient based methods
- Descent methods for monotone equilibrium problems in Banach spaces
- Uniform convexity and the splitting problem for selections
- An extension of the projected gradient method to a Banach space setting with application in structural topology optimization
- Computer-aided design via optimization: A review
- Strong convergence for gradient projection method and relatively nonexpansive mappings in Banach spaces
- First-order methods for convex optimization
- Proximal Gradient Methods for Machine Learning and Imaging
- Algorithms for some minimax problems
- The cyclic block conditional gradient method for convex optimization problems
- Proximal splitting methods in signal processing
- On the Convergence of a Greedy Algorithm for the Solution of the Problem for the Construction of Monotone Regression
- A PDE-constrained optimization approach for topology optimization of strained photonic devices
- The sliding Frank-Wolfe algorithm and its application to super-resolution microscopy
- Optimal Coatings, Bang‐Bang Controls, And Gradient Techniques
- Essentials of numerical nonsmooth optimization
- Farthest distance function to strongly convex sets
- A general iterative scheme based on regularization for solving equilibrium and constrained convex minimization problems
- Various perturbations and relaxations of the sweeping process
- Strong convergence of a hybrid projection iterative algorithm for common solutions of operator equations and of inclusion problems
- Approximate solution of the discrete optimal control problem
- Uniformly convex and uniformly smooth convex functions
- Operator splitting performance estimation: tight contraction factors and optimal parameter selection
- The gradient projection algorithm for smooth sets and functions in nonconvex case
- A hybrid gradient-projection algorithm for averaged mappings in Hilbert spaces
- Projection methods, isotone projection cones, and the complementarity problem
- A smoothing projected HS method for solving stochastic tensor complementarity problem
- The asymptotic behavior of the composition of two resolvents
- A geometric analysis of Renegar's condition number, and its interplay with conic curvature
- A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods
- Least-norm linear programming solution as an unconstrained minimization problem
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 Q5576518)