Results 111 to 120 of about 452,561 (173)
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A study of mathematical programmingmethods for structural optimization. Part II: Numerical results
International Journal for Numerical Methods in Engineering, 1985AbstractVarious mathematical programming methods for structural optimization are studied. In a companion paper, these methods have been studied based on certain theoretical considerations. In this paper, the methods are studied based on solving a set of test problems.
Belegundu, Ashok D., Arora, Jasbir S.
openaire +1 more source
Fixed point and Bregman iterative methods for matrix rank minimization
Mathematical programming, 2009The linearly constrained matrix rank minimization problem is widely applicable in many fields such as control, signal processing and system identification.
Shiqian Ma, D. Goldfarb, Lifeng Chen
semanticscholar +1 more source
International journal for numerical and analytical methods in geomechanics (Print), 2020
Pile serves as an essential component for transferring loads from superstructures to the soil ground. Proper consideration of soil‐structure interaction (SSI) responses is crucial in evaluating the pile capacity and deflections under external loads.
Xueyou Li +3 more
semanticscholar +1 more source
Pile serves as an essential component for transferring loads from superstructures to the soil ground. Proper consideration of soil‐structure interaction (SSI) responses is crucial in evaluating the pile capacity and deflections under external loads.
Xueyou Li +3 more
semanticscholar +1 more source
Reach-Avoid Problems via Sum-or-Squares Optimization and Dynamic Programming
IEEE/RJS International Conference on Intelligent RObots and Systems, 2018Reach-avoid problems involve driving a system to a set of desirable configurations while keeping it away from undesirable ones. Providing mathematical guarantees for such scenarios is challenging but have numerous potential practical applications. Due to
Benoit Landry +3 more
semanticscholar +1 more source
Relaxation schemes for mathematical programmes with switching constraints
Optim. Methods Softw., 2018Switching-constrained optimization problems form a difficult class of mathematical programmes since their feasible set is almost disconnected while standard constraint qualifications are likely to fail at several feasible points.
C. Kanzow, P. Mehlitz, D. Steck
semanticscholar +1 more source
Efficient numerical methods for entropy-linear programming problems
Computational Mathematics and Mathematical Physics, 2016A. Gasnikov +3 more
semanticscholar +1 more source
A Study of Mathematical Programming Methods for Structural Optimization
, 1985A. Belegundu
semanticscholar +1 more source

