science
plus
.abes.fr
|
explorer
À propos de :
Mathematical programming methods
Goto
Sponge
NotDistinct
Permalink
An Entity of Type :
skos:Concept
, within Data Space :
scienceplus.abes.fr
associated with source
document(s)
Type:
Concept
New Facet based on Instances of this Class
Attributs
Valeurs
type
Concept
rdfs:seeAlso
Mathematical programming
skos:inScheme
MSC 2010
broader concept
Mathematical programming, optimization and variational techniques
skos:prefLabel
Mathematical programming methods
数学规划法
skos:altLabel
Mathematical programming methods [See also 90Cxx]
数学规划法[参见90Cxx]
http://msc2010.org...0/msc2010#seeAlso
Mathematical programming
skos:closeMatch
from MSC1991 value of: Mathematical programming, [See also 90Cxx]
from MSC2000 value of: Mathematical programming algorithms {For theory see 90Cxx}
skos:notation
65K05
skos:note
See also 90Cxx.
skos:semanticRelation
Mathematical programming
is
Subject
of
Integer Programming Formulation of the Bilevel Knapsack Problem
A semi-smooth Newton method for solving elliptic equations with gradient constraints
Inequality-sum: a global constraint capturing the objective function
On a dual network exterior point simplex type algorithm and its computational behavior
Viterbi algorithms for Hidden semi-Markov Models with application to DNA Analysis
Convergence of a Neumann-Dirichlet algorithm for two-body contact problems with non local Coulomb's friction law
New conjugate gradient method for unconstrained optimization
An approach to robust network design in telecommunications
Kernel-function Based Primal-Dual Algorithms for P*( κ) Linear Complementarity Problems
Mesh-independence and preconditioning for solving parabolic control problems with mixed control-state constraints
Numerical solution of the Monge-Kantorovich problem by density lift-up continuation
How much do approximate derivatives hurt filter methods?
A certified reduced basis method for parametrized elliptic optimal control problems
Convergence analysis of adaptive trust region methods
Greedy algorithms for optimal computing of matrix chain products involving square dense and triangular matrices
New effective projection method for variational inequalities problem
A descent hybrid modification of the Polak-Ribière-Polyak conjugate gradient method
Abstract generalized epsilon-descent algorithm
Parallel implementation of an exact two-phase method for the biobjective knapsack problem
Accelerated nonmonotone line search technique for multiobjective optimization
An extragradient-type algorithm for variational inequality on Hadamard manifolds
Linear convergence of accelerated conditional gradient algorithms in spaces of measures
A primal-dual flow for affine constrained convex optimization
A consistent approximation of the total perimeter functional for topology optimization algorithms
A descent derivative-free algorithm for nonlinear monotone equations with convex constraints
A restart scheme for the Dai-Liao conjugate gradient method by ignoring a direction of maximum magnification by the search direction matrix
Multiple objective optimization Applied to Speech enhancement problem
Tighter bound functions for nonconvex functions over simplexes
On derivative based bounding for simplicial branch and bound
Tire noise optimization problem: a mixed integer linear programming approach
A modified Perry-type derivative-free projection method for solving large-scale nonlinear monotone equations
On the derivative-free quasi-Newton-type algorithm for separable systems of nonlinear equations
A new family of Dai-Liao conjugate gradient methods with modified secant equation for unconstrained optimization
Two new Hager-Zhang iterative schemes with improved parameter choices for monotone nonlinear systems and their applications in compressed sensing
New iterative conjugate gradient method for nonlinear unconstrained optimization
Coupled complex boundary method for a geometric inverse source problem
An efficient new hybrid CG-method as convex combination of DY and CD and HS algorithms
A modified nonlinear conjugate gradient algorithm for unconstrained optimization and portfolio selection problems
Two modified conjugate gradient methods for solving unconstrained optimization and application
Modification of some scalarization approaches for multiobjective optimization
A robust optimization approach for the production-routing problem with lateral transshipment and outsourcing
A sensitivity-based extrapolation technique for the numerical solution of state-constrained optimal control problems
Some recent developments in nonlinear optimization algorithms
Global convergence via modified self-adaptive approach for solving constrained monotone nonlinear equations with application to signal recovery problems
Dislocation hyperbolic augmented Lagrangian algorithm for nonconvex optimization
http://hub.abes.fr/edp/periodical/ro/2004/volume_38/issue_1/ro2223/w
The Team Orienteering Pick-Up and Delivery Problem with Time Windows and its applications in fleet sizing
Rate of convergence of the Nesterov accelerated gradient method in the subcritical case α ≤ 3
Solution uniqueness of convex piecewise affine functions based optimization with applications to constrained ℓ1 minimization
A weakly convergent fully inexact Douglas-Rachford method with relative error tolerance
Combination of two underestimators for univariate global optimization
Duality of variational problems with a new approach
Nonmonotone conic trust region method with line search technique for bound constrained optimization
An adaptive nonmonotone trust region method based on a modified scalar approximation of the Hessian in the successive quadratic subproblems
is
narrower concept
of
Mathematical programming, optimization and variational techniques
Alternative Linked Data Documents:
ODE
Content Formats:
RDF
ODATA
Microdata